Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126390
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A126390 a(n) = Sum_{i=0..n} 2^i*B(i)*binomial(n,i) where B(n) = Bell numbers A000110(n). +0
4
1, 3, 13, 71, 457, 3355, 27509, 248127, 2434129, 25741939, 291397789, 3510328695, 44782460313, 602513988107, 8518757813637, 126179029108463, 1952609274344353, 31492811964616163, 528249539951292461, 9197240228562763687, 165923214676585626729 (list; graph; listen)
OFFSET

0,2

FORMULA

E.g.f.: exp(exp(2*x)-1+x). - Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 04 2007

a(n) = e^(-1)* (2)^n * sum( (k+1/2)^n / k!, k=0..infinity ). This is a Dobinski-type formula. - Karol A. Penson (penson(AT)lptl.jussieu.fr) and Olivier Gerard, Oct 22 2007

MAPLE

with(combstruct):seq(count(([S, {N=Union(Z, S, P), S=Set(Union(Z, P), card>=0), P=Set(Union(Z, Z), card>=1)}, labeled], size=n)), n=0..20); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 18 2008

MATHEMATICA

Table[ Sum[ (2)^(k) Binomial[n, k] BellB[k], {k, 0, n}], {n, 0, 30}] - Karol A. Penson (penson(AT)lptl.jussieu.fr) and Olivier Gerard, Oct 22 2007

CROSSREFS

Cf. A000110, A000296, A005493, A124311, A126617.

Sequence in context: A001495 A162326 A122455 this_sequence A003319 A158882 A000261

Adjacent sequences: A126387 A126388 A126389 this_sequence A126391 A126392 A126393

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Aug 04 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 November 24 19:42 EST 2009. Contains 167435 sequences.


AT&T Labs Research