0,3

Stirling transform of A052849(n)=[1,4,12,48,240,...] is a(n)=[1,5,25,149,1081,..]. - Michael Somos Mar 04 2004

Stirling transform of A000142(n-1)=[0,1,2,6,24,...] is a(n-1)=[0,1,5,25,149,...]. - Michael Somos Mar 04 2004

Stirling transform of 2*A005359(n-1)=[1,0,4,0,48,0,...] is a(n-1)=[1,1,5,25,149,...]. - Michael Somos Mar 04 2004

"Stirling-Bernoulli transform" of A000225. - Paul Barry (pbarry(AT)wit.ie), Apr 20 2005

G. J. Simmons, A combinatorial problem associated with a family of combination locks, Math. Mag., 37 (1964), 127-132 (but there are errors).

J. F. Steffensen, On a class of polynomials and their application to actuarial problems, Skandinavisk Aktuarietidskrift, Vol. 11, pp. 75-97, 1928.

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

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 149

E.g.f.: (exp(2x)-exp(x))/(2-exp(x)).

a(n)=sum{k=0..n, (-1)^(n-k)k!*S2(n, k)(2^k-1)}. - Paul Barry (pbarry(AT)wit.ie), Apr 20 2005

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

a(n) = A000629(n) - 1.

Adjacent sequences: A002047 A002048 A002049 this_sequence A002051 A002052 A002053

Sequence in context: A121639 A098349 A098212 this_sequence A047782 A106565 A092166

nonn,easy,nice

njas

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Aug 22 2000