Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126443
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A126443 a(n) = Sum_{k=0..n-1} C(n-1,k)*a(k)*2^k for n>0, with a(0)=1. +0
1
1, 1, 3, 17, 179, 3489, 127459, 8873137, 1195313043, 315321098561, 164239990789571, 169810102632595281, 349630019758589841523, 1436268949679165936016097, 11784559509424676876673518499 (list; graph; listen)
OFFSET

0,3

COMMENT

Generated by a generalization of a recurrence for the Bell numbers (A000110).

FORMULA

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

PROGRAM

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

CROSSREFS

Cf. A126347, A000110.

Sequence in context: A069856 A015083 A053934 this_sequence A054976 A088678 A133991

Adjacent sequences: A126440 A126441 A126442 this_sequence A126444 A126445 A126446

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 7 15:23 EDT 2008. Contains 143483 sequences.


AT&T Labs Research