Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132228
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A132228 a(n) = Sum_{k=0..n} C(n-1,k)^2*a(k)*a(n-k-1) for n>0 with a(0)=1. +0
1
1, 1, 2, 8, 52, 504, 6808, 122304, 2820048, 81183200, 2853990496, 120321094656, 5991955466560, 347996920977664, 23312947041336960, 1784445116557881344, 154767015393810489600, 15098457734490931766784 (list; graph; listen)
OFFSET

0,3

PROGRAM

(PARI) a(n)=if(n==0, 1, sum(k=0, n-1, a(k)*a(n-k-1)*binomial(n-1, k)^2 ))

CROSSREFS

Cf. A001059.

Adjacent sequences: A132225 A132226 A132227 this_sequence A132229 A132230 A132231

Sequence in context: A006351 A089467 A103239 this_sequence A057629 A079503 A052694

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Aug 15 2007

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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research