Related papers: Hankel-type determinants for some combinatorial se…

For all nonnegative integers n, the Franel numbers are defined as $$ f_n=\sum_{k=0}^n {n\choose k}^3.$$ We confirm two conjectures of Z.-W. Sun on congruences for Franel numbers: \sum_{k=0}^{n-1}(3k+2)(-1)^k f_k &\equiv 0 \pmod{2n^2},…

For small $r$ the Hankel determinants $d_r(n)$ of the sequence $\left({2n+r\choose n}\right)_{n\ge 0}$ are easy to guess and show an interesting modular pattern. For arbitrary $r$ and $n$ no closed formulae are known, but for each positive…

The Ap\'ery numbers $A_n$ and the Franel numbers $f_n$ are defined by $$A_n=\sum_{k=0}^{n}{\binom{n+k}{2k}}^2{\binom{2k}{k}}^2\ \ \ \ \ {\rm and }\ \ \ \ \ \ f_n=\sum_{k=0}^{n}{\binom{n}{k}}^3(n=0, 1, \cdots,).$$ In this paper, we prove…

The Franel numbers are defined by $ f_n=\sum_{k=0}^n {n\choose k}^3. $ Motivated by the recent work of Z.-W. Sun on Franel numbers, we prove that \begin{align*} \sum_{k=0}^{n-1}(3k+1)(-16)^{n-k-1} {2k\choose k} f_k &\equiv…

In 1998, Allouche, Peyri\`ere, Wen and Wen established that the Hankel determinants associated with the Thue--Morse sequence on $\{-1, 1\}$ are always nonzero. Their proof depends on a set of sixteen recurrence relations. We present an…

For a real number $t$, let $r_\ell(t)$ be the total weight of all $t$-large Schr\"{o}der paths of length $\ell$, and $s_\ell(t)$ be the total weight of all $t$-small Schr\"{o}der paths of length $\ell$. For constants $\alpha, \beta$, in…

The Hankel determinants $\left(\frac{r}{2(i+j)+r}\binom{2(i+j)+r}{i+j}\right)_{0\leq i,j \leq n-1}$ of the convolution powers of Catalan numbers were considered by Cigler and by Cigler and Krattenthaler. We evaluate these determinants for…

In this paper we study some conjectures on determinants with Jacobi symbol entries posed by Z.-W. Sun. For any positive integer $n\equiv3\pmod4$, we show that $$(6,1)_n=[6,1]_n=(3,2)_n=[3,2]_n=0$$ and…

We consider Hankel determinants of the sequence of Catalan numbers modulo 2 (interpreted as integers 0 and 1) and more generally Hankel determinants where the sum over all permutations reduces to a single signed permutation.

In this paper we confirm three conjectures of Z.-W. Sun on determinants. We first show that any odd integer $n>3$ divides the determinant $$\left|(i^2+dj^2)\left(\frac{i^2+dj^2}n\right)\right|_{0\le i,j\le (n-1)/2},$$ where $d$ is any…

In this paper, we mainly prove the following conjectures of Z.-W. Sun \cite{S13}: Let $p>2$ be a prime. If $p=x^2+3y^2$ with $x,y\in\mathbb{Z}$ and $x\equiv1\pmod 3$, then $$x\equiv\frac14\sum_{k=0}^{p-1}(3k+4)\frac{f_k}…

The harmonic numbers $H_n=\sum_{0<k\ls n}1/k\ (n=0,1,2,\ldots)$ play important roles in mathematics. With helps of some combinatorial identities, we establish the following two congruences:…

An infinite $\pm 1$-sequence is called {\it Apwenian} if its Hankel determinant of order $n$ divided by $2^{n-1}$ is an odd number for every positive integer $n$. In 1998, Allouche, Peyri\`ere, Wen and Wen discovered and proved that the…

In 1998, Allouche, Peyri\`ere, Wen and Wen considered the Thue--Morse sequence, and proved that all the Hankel determinants of the period-doubling sequence are odd integral numbers. We speak of $t$-extension when the entries along the…

The Apery polynomials are defined by $A_n(x)=\sum_{k=0}^{n}{n\choose k}^2{n+k\choose k}^2 x^k$ for all nonnegative integers $n$. We confirm several conjectures of Z.-W. Sun on the congruences for the sum $\sum_{k=0}^{n-1}(-1)^k(2k+1)…

The Hankel determinants of certain automatic sequences $f$ are evaluated, based on a calculation modulo a prime number. In most cases, the Hankel determinants of automatic sequences do not have any closed-form expressions; the traditional…

The Euler numbers occur in the Taylor expansion of $\tan(x)+\sec(x)$. Since Stieltjes, continued fractions and Hankel determinants of the even Euler numbers, on the one hand, of the odd Euler numbers, on the other hand, have been widely…

Hankel determinants and automatic sequences are two classical subjects widely studied in Mathematics and Theoretical Computer Science. However, these two topics were considered totally independently, until in 1998, when Allouche,…

The Franel numbers given by $f_n=\sum_{k=0}^n\binom{n}{k}^3$ ($n=0,1,2,\ldots$) play important roles in both combinatorics and number theory. In this paper we initiate the systematic investigation of fundamental congruences for the Franel…

For a single value of $\ell$, let $f(n,\ell)$ denote the number of lattice paths that use the steps $(1,1)$, $(1,-1)$, and $(\ell,0)$, that run from $(0,0)$ to $(n,0)$, and that never run below the horizontal axis. Equivalently, $f(n,\ell)$…