A138912 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A138912

Inverse binomial transform of A138911.

1, 1, 2, 9, 28, 145, 726, 4249, 27000, 186561, 1387450, 11034001, 93295236, 834720913, 7870851366, 77943848025, 808159323376, 8749874083585, 98687599614450, 1157060036429857, 14075106913366140, 177337182574590801

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

COMMENTS

The n-th term of the n-th inverse binomial transform of A138911 is 1 for n>=0.

LINKS

Table of n, a(n) for n=0..21.

FORMULA

O.g.f. satisfies: [x^n] A( x/(1+(n-1)*x) )/(1+(n-1)*x) = 1 for n>=0.

E.g.f. satisfies: [x^n] A(x)*exp(-(n-1)*x) = 1/n! for n>=0.

PROG

(PARI) {a(n)=local(A=[1]); for(k=1, n, A=concat(A, 0); A[k+1]=1-polcoeff(subst(Ser(A), x, x/(1+(k-1)*x+x*O(x^k)))/(1+(k-1)*x), k)); A[n+1]}