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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A135745 E.g.f.: A(x) = Sum_{n>=0} exp((n-1)*x)^n * x^n/n!. 6
1, 1, 1, 7, 49, 501, 6841, 115123, 2362305, 57768553, 1646192881, 53952383871, 2010872281969, 84330050952733, 3945169959883881, 204416253047774251, 11655594262050124801, 727189793270478477777, 49395902623624761264865 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
FORMULA
a(n) = Sum_{k=0..n} C(n,k)*[k*(k-1)]^(n-k).
O.g.f.: Sum_{n>=0} x^n/(1 - n*(n-1)*x)^(n+1). - Paul D. Hanna, Jul 30 2014
MATHEMATICA
Flatten[{1, Table[Sum[Binomial[n, k]*(k*(k - 1))^(n - k), {k, 0, n}], {n, 1, 25}]}] (* G. C. Greubel, Nov 05 2016 *)
PROG
(PARI) {a(n)=sum(k=0, n, binomial(n, k)*(k*(k-1))^(n-k))}
for(n=0, 25, print1(a(n), ", "))
(PARI) {a(n)=n!*polcoeff(sum(k=0, n, exp(k*(k-1)*x +x*O(x^n))*x^k/k!), n)}
for(n=0, 25, print1(a(n), ", "))
(PARI) /* From Sum_{n>=0} x^n/(1 - n*(n-1)*x)^(n+1): */
{a(n)=polcoeff(sum(k=0, n, x^k/(1-k*(k-1)*x +x*O(x^n))^(k+1)), n)}
for(n=0, 25, print1(a(n), ", "))
CROSSREFS
Sequence in context: A204211 A349117 A125796 * A080895 A047899 A229041
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Nov 27 2007
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 10:11 EDT 2024. Contains 371935 sequences. (Running on oeis4.)