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!)
A360319 a(n) = Sum_{k=0..n} 4^(n-k) * binomial(n-1,n-k) * binomial(2*k,k). 4
1, 2, 14, 100, 726, 5340, 39692, 297544, 2245990, 17050796, 130061412, 996078456, 7654571772, 58995989400, 455857911768, 3530234227344, 27392392806534, 212918339726028, 1657570714812020, 12922254685161112, 100867892292766612 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
G.f.: sqrt( (1-4*x)/(1-8*x) ).
n*a(n) = 2*(6*n-5)*a(n-1) - 32*(n-2)*a(n-2).
Sum_{i=0..n} Sum_{j=0..i} (1/4)^i * a(j) * a(i-j) = 2^n.
a(n) ~ 2^(3*n - 1/2) / sqrt(Pi*n). - Vaclav Kotesovec, Feb 04 2023
PROG
(PARI) a(n) = sum(k=0, n, 4^(n-k)*binomial(n-1, n-k)*binomial(2*k, k));
(PARI) my(N=30, x='x+O('x^N)); Vec(sqrt((1-4*x)/(1-8*x)))
CROSSREFS
Sequence in context: A037719 A158811 A198280 * A074620 A185010 A144277
KEYWORD
nonn,easy
AUTHOR
Seiichi Manyama, Feb 03 2023
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 September 14 16:47 EDT 2024. Contains 375929 sequences. (Running on oeis4.)