login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A341491 a(n) = binomial(6*n, n) * hypergeom([-5*n, -n], [-6*n], -1). 5
1, 11, 221, 4991, 118721, 2908411, 72616013, 1837271615, 46943003137, 1208483403179, 31297149356221, 814471993937855, 21281058718583873, 557930580979801755, 14669716953106628781, 386675596518995000191, 10214494658006725840897, 270345191656309313382475 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
In general, for k > 1, binomial(k*n, n) * hypergeom([(1-k)*n, -n], [-k*n], -1) ~ sqrt((k + (k^2 - k + 1) / sqrt(k^2 - 2*k + 2)) / (4*(k-1)*Pi*n)) * ((A341476(k) + A341477(k)*sqrt((k-1)^2 + 1)) / (k-1)^(k-1))^n.
LINKS
Lin Yang, Yu-Yuan Zhang, and Sheng-Liang Yang, The halves of Delannoy matrix and Chung-Feller properties of the m-Schröder paths, Linear Alg. Appl. (2024).
FORMULA
a(n) ~ sqrt((6 + 31/sqrt(26))/(20*Pi*n)) * (42671 + 8346*sqrt(26))^n / 5^(5*n).
MATHEMATICA
Table[Binomial[6*n, n] * Hypergeometric2F1[-5*n, -n, -6*n, -1], {n, 0, 20}]
CROSSREFS
Sequence in context: A035012 A179339 A055411 * A064093 A087402 A048377
KEYWORD
nonn
AUTHOR
Vaclav Kotesovec, Feb 13 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 21:51 EDT 2024. Contains 371781 sequences. (Running on oeis4.)