Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001861
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001861 Expansion of exp {2 (exp(x) - 1)}.
(Formerly M1662 N0653)
+0
28
1, 2, 6, 22, 94, 454, 2430, 14214, 89918, 610182, 4412798, 33827974, 273646526, 2326980998, 20732504062, 192982729350, 1871953992254, 18880288847750, 197601208474238, 2142184050841734, 24016181943732414, 278028611833689478 (list; graph; listen)
OFFSET

0,2

COMMENT

Values of Bell polynomials: ways of placing n labeled balls into n unlabeled (but 2-colored) boxes.

First column of the square of the matrix exp(P)/exp(1) given in A011971. - Gottfried Helms (helms(AT)uni-kassel.de), Mar 30 2007.

Base matrix in A011971, second power in A078937, third power in A078938, fourth power in A078939. - Gottfried Helms (helms(AT)uni-kassel.de), Apr 08 2007

REFERENCES

T. S. Motzkin, Sorting numbers ...: for a link to this paper see A000262.

M. Aigner, A characterization of the Bell numbers, Discr. Math., 205 (1999), 207-210.

G. Labelle et al., Stirling numbers interpolation using permutations with forbidden subsequences, Discrete Math. 246 (2002), 177-195.

T. S. Motzkin, Sorting numbers for cylinders and other classification numbers, in Combinatorics, Proc. Symp. Pure Math. 19, AMS, 1971, pp. 167-176.

LINKS

T. D. Noe, Table of n, a(n) for n=0..100

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 66

Zerinvary Lajos, Sage Notebooks

FORMULA

sum(2^k*stirling2(n, k), k=1..n). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Oct 20 2001

a(n) = exp(-2)*sum(k>=1, 2^k*k^n/k! ) - Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 25 2003

G.f. satisfies 2*(x/(1-x))*A(x/(1-x)) = A(x) - 1; twice the binomial transform equals the sequence shifted one place left. - Paul D. Hanna (pauldhanna(AT)juno.com), Dec 08 2003

With exact integer arithmetic (no infinite exp-sum needed): PE=exp(matpascal(5)-matid(6)); A = PE^2; a(n)=A[n,1]. - Gottfried Helms (helms(AT)uni-kassel.de), Apr 08 2007

PROGRAM

(PARI) a(n)=if(n<0, 0, n!*polcoeff(exp(2*(exp(x+x*O(x^n))-1)), n))

sage: from sage.combinat.expnums import expnums2 sage: expnums(30, 2) - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 26 2008

CROSSREFS

For boxes of 1 color, see A000110, for 3 colors see A027710.

First column of A078937. Equals 2*A035009(n), n>0.

Row sums of A033306, of A036073, and of A049020.

Cf. A000587, A002871, A068199, A068200, A068201.

Cf. A056857, A078937, A078938, A078944, A078945, A000110, A078937, A078938, A129323, A129324, A129325, A027710, A129327, A129328, A129329, A078944, A129331, A129332, A129333.

Sequence in context: A109317 A109153 A030453 this_sequence A049526 A093793 A087959

Adjacent sequences: A001858 A001859 A001860 this_sequence A001862 A001863 A001864

KEYWORD

nonn,easy,nice

AUTHOR

njas, Simon Plouffe (plouffe(AT)math.uqam.ca)

page 1

Search completed in 0.003 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research