Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A152600
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A152600 a(n)=0^n+sum{k=0..n-1, C(n+k-1,2k)*A000108(k)*3^k*2^(n-k)} +0
2
1, 2, 10, 80, 790, 8720, 103060, 1275680, 16326190, 214280720, 2868504460, 39014154080, 537592643740, 7488960021920, 105295566289960, 1492291482505280, 21296015905884190, 305755507155234320 (list; graph; listen)
OFFSET

0,2

COMMENT

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

CROSSREFS

Sequence in context: A108486 A152168 A003578 this_sequence A048286 A133480 A008544

Adjacent sequences: A152597 A152598 A152599 this_sequence A152601 A152602 A152603

KEYWORD

easy,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 17 19:39 EST 2009. Contains 170821 sequences.


AT&T Labs Research