Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126444
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A126444 a(n) = Sum_{k=0..n-1} C(n-1,k)*a(k)*a(n-1-k)*2^k for n>0, with a(0)=1. +0
1
1, 1, 3, 19, 225, 4801, 185523, 13298659, 1815718305, 481790947681, 251592291767043, 260427247041910099, 536497603929547755585, 2204489516030261302702561, 18090090482887693483393912563 (list; graph; listen)
OFFSET

0,3

COMMENT

Generated by a generalization of a recurrence for the factorials.

FORMULA

a(n) = Sum_{k=0..n*(n-1)/2} A126470(n,k)*2^k.

PROGRAM

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

CROSSREFS

Cf. A126470.

Sequence in context: A136652 A136504 A003111 this_sequence A001929 A135754 A118023

Adjacent sequences: A126441 A126442 A126443 this_sequence A126445 A126446 A126447

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jan 01 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 September 6 00:03 EDT 2008. Contains 143485 sequences.


AT&T Labs Research