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!)
A066797 a(n) = Sum_{i=1..n} binomial(4*i,2*i). 2
6, 76, 1000, 13870, 198626, 2902782, 43019382, 644099772, 9719235072, 147565763892, 2251664727612, 34499268410712, 530417801358816, 8179108402119256, 126443689966980680, 1959067830909571214 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
G.f.: ((1+4*sqrt(x))^(-1/2) + (1-4*sqrt(x))^(-1/2) - 2)/(2-2*x). - Mark van Hoeij, May 02 2013
Recurrence: n*(2*n-1)*a(n) = (34*n^2 - 33*n + 6)*a(n-1) - 2*(4*n-3)*(4*n-1)*a(n-2). - Vaclav Kotesovec, Aug 16 2013
a(n) ~ 2^(4*n+3)/(15*sqrt(Pi*n/2)). - Vaclav Kotesovec, Aug 16 2013
PROG
(PARI) { a=0; for (n=1, 150, write("b066797.txt", n, " ", a+=binomial(4*n, 2*n)) ) } \\ Harry J. Smith, Mar 27 2010
CROSSREFS
Sequence in context: A053337 A199026 A155643 * A333097 A231281 A120593
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Jan 18 2002
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 25 06:14 EDT 2024. Contains 371964 sequences. (Running on oeis4.)