login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A152600 a(n)=0^n+sum{k=0..n-1, C(n+k-1,2k)*A000108(k)*3^k*2^(n-k)} 1
1, 2, 10, 80, 790, 8720, 103060, 1275680, 16326190, 214280720, 2868504460, 39014154080, 537592643740, 7488960021920, 105295566289960, 1492291482505280, 21296015905884190, 305755507155234320 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Hankel transform is 2^n*3^C(n+1,2)*5^C(n,2). A152601(n)=a(n+1)/2.

FORMULA

a(n) = 2^n * (4*(n+1)*LegendreP(n+1,4) - (31*n+16)*LegendreP(n,4))/(3*n*(n-1)) for n>1 [From Mark van Hoeij (hoeij(AT)math.fsu.edu), May 27 2010]

CROSSREFS

Sequence in context: A108486 A152168 A003578 * A048286 A133480 A008544

Adjacent sequences:  A152597 A152598 A152599 * A152601 A152602 A152603

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Dec 09 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 13:28 EST 2012. Contains 206031 sequences.