Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Hankel-type determinants for some combinatorial sequences (1609.06810v4)

Published 22 Sep 2016 in math.CO

Abstract: In this paper we confirm several conjectures of Z.-W. Sun on Hankel-type determinants for some combinatorial sequences including Franel numbers, Domb numbers and Ap\'ery numbers. For any nonnegative integer $n$, define \begin{gather*}f_n:=\sum_{k=0}n\binom nk3,\ D_n:=\sum_{k=0}n\binom nk2\binom{2k}k\binom{2(n-k)}{n-k}, b_n:=\sum_{k=0}n\binom nk2\binom{n+k}k,\ A_n:=\sum_{k=0}n\binom nk2\binom{n+k}k2. \end{gather*} For $n=0,1,2,\ldots$, we show that $6{-n}|f_{i+j}|_{0\leq i,j\leq n}$ and $12{-n}|D_{i+j}|_{0\le i,j\le n}$ are positive odd integers, and $10{-n}|b_{i+j}|_{0\leq i,j\leq n}$ and $24{-n}|A_{i+j}|_{0\leq i,j\leq n}$ are always integers.

Summary

We haven't generated a summary for this paper yet.