A122399 -id:A122399 - cp's OEIS frontend

A121886 a(n) = (1/n!)* Sum_{k=0..n} |Stirling1(n,k)|*A122399(k).

1, 1, 5, 40, 444, 6324, 110023, 2261576, 53632424, 1441341350, 43290170494, 1437020742408, 52243864528990, 2064488610832106, 88106523694973953, 4038627301344466648, 197888243609535940091, 10321811633042512528240

Offset: 0

Vladeta Jovovic, Aug 31 2006

Number of square matrices with nonnegative integer entries and without zero rows such that sum of all entries is equal to n. - Vladeta Jovovic, Mar 04 2008

			G.f.: A(x) = 1 + x + 5*x^2 + 40*x^3 + 444*x^4 + 6324*x^5 +...
where
A(x) = 1 + (1/(1-x) - 1) + (1/(1-x)^2 - 1)^2 + (1/(1-x)^3 - 1)^3 + ...
Also,
A(x) = 1/2 + (1-x)/(1 + (1-x))^2 + (1-x)^2/(1 + (1-x)^2)^3 +  + (1-x)^3/(1 + (1-x)^3)^4 + (1-x)^4/(1 + (1-x)^4)^5 + ...

Cf. A104209, A220352.

Flatten[{1,Table[1/n!* Sum[Abs[StirlingS1[n,k]]*Sum[m^k*m!*StirlingS2[k, m], {m, 1, k}],{k,0,n}],{n,1,20}]}] (* Vaclav Kotesovec, May 07 2014 *)

{a(n)=polcoeff(sum(m=0,n,(1/(1-x+x*O(x^n))^m-1)^m),n)}

G.f.: Sum_{n>=0} ( 1/(1-x)^n - 1 )^n.
G.f.: Sum_{n>=0} (1-x)^n / (1 + (1-x)^n)^(n+1). - Paul D. Hanna, Sep 07 2018
a(n) ~ c * d^n * n! / sqrt(n), where d = A317855 = (1+exp(1/r))*r^2 = 3.161088653865428813830172202588132491726382774188556341627278..., r = 0.8737024332396683304965683047207192982139922672025395099... is the root of the equation exp(1/r)/r + (1+exp(1/r))*LambertW(-exp(-1/r)/r) = 0, and c = 0.38377369607518184186200387319561108... . - Vaclav Kotesovec, May 07 2014

More terms from Max Alekseyev, Feb 01 2007

A220181 E.g.f.: Sum_{n>=0} (1 - exp(-n*x))^n.

Original entry on oeis.org

1, 1, 7, 115, 3451, 164731, 11467387, 1096832395, 138027417451, 22111390122811, 4393756903239067, 1060590528331645675, 305686632592587314251, 103695663062502304228891, 40895823706632785802087547, 18554695374154504939196298955, 9596336362873294022956267703851

Offset: 0

Paul D. Hanna, Dec 06 2012

Compare to the trivial identity: exp(x) = Sum_{n>=0} (1 - exp(-x))^n.
Compare to the e.g.f. of A092552: Sum_{n>=1} (1 - exp(-n*x))^n/n.
From Arvind Ayyer, Oct 25 2020: (Start)
a(n) is also the number of acyclic orientations with unique sink of the complete bipartite graph K_{n,n+1}
a(n) is also the number of toppleable permutations in S_{2n}. A toppleable permutation pi in S_{2n} satisfies pi_i <= n-1+i for 1 <= i <= n+1 and pi_i >= i-n for n+2 <= i <= 2n. (End)
Conjecture: Let p be prime. The sequence obtained by reducing a(n) modulo p for n >= 1 is purely periodic with period p - 1. For example, modulo 7 the sequence becomes [1, 0, 3, 0, 0, 1, 1, 0, 3, 0, 0, 1, 1, 0, 3, 0, 0, 1 ...], with an apparent period of 6. Cf. A122399. - Peter Bala, Jun 01 2022

			O.g.f.: F(x) = 1 + x + 7*x^2 + 115*x^3 + 3451*x^4 + 164731*x^5 +...
where F(x) = 1 + x/(1+x) + 2^2*2!*x^2/((1+2*1*x)*(1+2*2*x)) + 3^3*3!*x^3/((1+3*1*x)*(1+3*2*x)*(1+3*3*x)) + 4^4*4!*x^4/((1+4*1*x)*(1+4*2*x)*(1+4*3*x)*(1+4*4*x)) +...
...
E.g.f.: A(x) = 1 + x + 7*x^2/2! + 115*x^3/3! + 3451*x^4/4! + 164731*x^5/5! +...
where the e.g.f. satisfies the identities:
(1) A(x) = 1 + (1-exp(-x)) + (1-exp(-2*x))^2 + (1-exp(-3*x))^3 + (1-exp(-4*x))^4 + (1-exp(-5*x))^5 + (1-exp(-6*x))^6 +...
(2) A(x) = exp(-x) + exp(-2*x)*(1-exp(-2*x)) + exp(-3*x)*(1-exp(-3*x))^2 + exp(-4*x)*(1-exp(-4*x))^3 + exp(-5*x)*(1-exp(-5*x))^4 + exp(-6*x)*(1-exp(-6*x))^5 +...
(3) 2*A(x) = 2 + (1-exp(-2*x)) + (1-exp(-3*x))^2 + (1-exp(-4*x))^3 + (1-exp(-5*x))^4 + (1-exp(-6*x))^5 + (1-exp(-7*x))^6 +...
E.g.f. at offset=1 begins:
B(x) = x + x^2/2! + 7*x^3/3! + 115*x^4/4! + 3451*x^5/5! + 164731*x^6/6! +...
where
B(x) = (1-exp(-x)) + (1-exp(-2*x))^2/2^2 + (1-exp(-3*x))^3/3^2 + (1-exp(-4*x))^4/4^2 + (1-exp(-5*x))^5/5^2 + (1-exp(-6*x))^6/6^2 +...
The series  B(x) = Sum_{n>=1} (1 - exp(-n*x))^n / n^2  may be rewritten as:
B(x) = Pi^2/6 + log(1-exp(-x)) + Sum_{n>=2} (n-1)*exp(-2*n*x)/(2*n) -
Sum_{n>=3} C(n-1,2)*exp(-3*n*x)/(3*n) + Sum_{n>=4} C(n-1,3)*exp(-4*n*x)/(4*n) -+...

Vincenzo Librandi, Table of n, a(n) for n = 0..200
A. Ayyer, D. Hathcock and P. Tetali, Toppleable Permutations, Excedances and Acyclic Orientations, arXiv:2010.11236 [math.CO], 2020. For the precise definition of a toppleable permutation.

Cf. A136126, A092552, A048163, A220179, A122399, A187755, A203798, A320096, A338040.

Flatten[{1,Table[Sum[(-1)^(n-k)*k^n*k!*StirlingS2[n,k],{k,0,n}],{n,1,20}]}] (* Vaclav Kotesovec, Jun 21 2013 *)

{a(n)=polcoeff(sum(m=0,n,m^m*m!*x^m/prod(k=1,m,1+m*k*x+x*O(x^n))),n)}
for(n=0, 20, print1(a(n), ", "))

{a(n)=n!*polcoeff(sum(k=0, n, (1-exp(-k*x+x*O(x^n)))^k), n)}
for(n=0, 20, print1(a(n), ", "))

/* Formula for this sequence with offset=1: */
{a(n)=n!*polcoeff(sum(k=1, n, (1-exp(-k*x+x*O(x^n)))^k/k^2), n)}
for(n=1, 21, print1(a(n), ", "))

{Stirling2(n, k)=n!*polcoeff(((exp(x+x*O(x^n))-1)^k)/k!, n)}
{a(n) = sum(k=0,n,(-1)^(n-k)*k^n*k!*Stirling2(n, k))}
for(n=0, 20, print1(a(n), ", "))

{Stirling2(n, k)=n!*polcoeff(((exp(x+x*O(x^n))-1)^k)/k!, n)}
{a(n) = if(n==0,1,sum(k=1,n+1,((k-1)!)^2*Stirling2(n+1,k)^2/2))}
for(n=0, 20, print1(a(n), ", "))

{a(n)=sum(k=0,n, k^n*sum(j=0,k, (-1)^(n+k-j)*binomial(k,j)*(k-j)^n))}
for(n=0, 20, print1(a(n), ", "))

O.g.f. Sum_{n>=0} n^n * n! * x^n / Product_{k=1..n} (1 + n*k*x).
E.g.f. A(x) = Sum_{n>=0} (1 - exp(-n*x))^n  satisfies the identities:
(1) A(x) = Sum_{n>=1} exp(-n*x) * (1 - exp(-n*x))^(n-1).
(2) A(x) = 1 + (1/2) * Sum_{n>=1} (1 - exp(-n*x))^(n-1).
(3) A(x) = Sum_{n>=1} Sum_{k>=0} (-1)^k * C(n+k-1,k) * exp(-k*(n+k-1)*x).
E.g.f. at offset 1, B(x) = Sum_{n>=1} a(n-1)*x^n/n!, satisfies:
(1) B(x) = Sum_{n>=1} (1 - exp(-n*x))^n / n^2.
(2) B(x) = Pi^2/6 + log(1-exp(-x)) + Sum_{k>=2} Sum_{n>=k} (-1)^k * C(n-1,k-1) * exp(-k*n*x)/(k*n), a convergent series for x>0.
a(n) = Sum_{k=0..n} (-1)^(n-k) * k^n * k! * Stirling2(n,k).
a(n) = Sum_{k=1..n+1} ((k-1)!)^2 * Stirling2(n+1,k)^2 / 2 for n>0 with a(0)=1.
a(n) = Sum_{k=0..n} k^n * Sum_{j=0..k} (-1)^(n+k-j) * binomial(k,j) * (k-j)^n.
a(n) = A048163(n+1)/2 for n>0.
Limit n->infinity (a(n)/n!)^(1/n)/n = 1/(exp(1)*(log(2))^2) = 0.7656928576... - Vaclav Kotesovec, Jun 21 2013
a(n) ~ sqrt(Pi) * n^(2*n+1/2) / (sqrt(1-log(2)) * exp(2*n) * (log(2))^(2*n+1)). - Vaclav Kotesovec, May 13 2014

A122400 Number of square (0,1)-matrices without zero rows and with exactly n entries equal to 1.

Original entry on oeis.org

1, 1, 4, 31, 338, 4769, 82467, 1687989, 39905269, 1069863695, 32071995198, 1062991989013, 38596477083550, 1523554760656205, 64961391010251904, 2975343608212835855, 145687881987604377815, 7594435556630244257213

Offset: 0

Vladeta Jovovic, Aug 31 2006

G. C. Greubel, Table of n, a(n) for n = 0..375

Cf. A104602, A220353, A301581, A301582, A301583, A301584.

A122399 := proc(n) option remember ; add( combinat[stirling2](n,k)*k^n*k!,k=0..n) ; end: A122400 := proc(n) option remember ; add( combinat[stirling1](n,k)*A122399(k),k=0..n)/n! ; end: for n from 0 to 30 do printf("%d, ",A122400(n)) ; od ; # R. J. Mathar, May 18 2007

max = 17; CoefficientList[ Series[ 1 + Sum[ ((1 + x)^n - 1)^n, {n, 1, max}], {x, 0, max}], x] (* Jean-François Alcover, Mar 26 2013, after Vladeta Jovovic *)

a(n) = (1/n!)* Sum_{k=0..n} Stirling1(n,k)*A122399(k).
G.f.: Sum_{n>=0} ((1+x)^n - 1)^n. - Vladeta Jovovic, Sep 03 2006
G.f.: Sum_{n>=0} (1+x)^(n^2) / (1 + (1+x)^n)^(n+1). - Paul D. Hanna, Mar 23 2018
a(n) ~ c * d^n * n! / sqrt(n), where d = A317855 = (1+exp(1/r))*r^2 = 3.161088653865428813830172202588132491726382774188556341627278..., r = 0.8737024332396683304965683047207192982139922672025395099... is the root of the equation exp(1/r)/r + (1+exp(1/r))*LambertW(-exp(-1/r)/r) = 0, and c = 0.2796968489586733500739737080739303725411427162653658... . - Vaclav Kotesovec, May 07 2014

More terms from R. J. Mathar, May 18 2007

A048144 a(n) = Sum_{k=0..n} (k!)^2 * Stirling_2(n,k)^2.

Original entry on oeis.org

1, 1, 5, 73, 2069, 95401, 6487445, 610093513, 75796724309, 12020754177001, 2369364111428885, 568128719132038153, 162835627057766030549, 54975855375379966645801, 21593185551426744571090325, 9762238510837560633366673993, 5033241437347149354018370856789

Offset: 0

N. J. A. Sloane

Number of digraphs with loops, with labeled vertices and labeled arcs, with n arcs and with no vertex of indegree 0 or outdegree 0, cf. A121936, A122418, A122399. - Vladeta Jovovic, Sep 06 2006
Chromatic invariant of the complete bipartite graph K_{n+1,n+1}. - Eric W. Weisstein, Jul 11 2011
Generally, for p >= 1, Sum_{k=0..n} (k!*StirlingS2(n,k))^p is asymptotic to n^(p*n+1/2) * sqrt(Pi/(2*p*(1-log(2))^(p-1))) / (exp(p*n) * log(2)^(p*n+1)). - Vaclav Kotesovec, May 10 2014

Alois P. Heinz, Table of n, a(n) for n = 0..100
Eric Weisstein's World of Mathematics, Chromatic Invariant
Eric Weisstein's World of Mathematics, Complete Bipartite Graph

Cf. A000670, A242280, A212084, A120732, A104602, A272644, A371761.

a := proc(n) local A, j; A := proc(n, k) option remember; if n = 0 then n^k else add(binomial(k + `if`(j>0, 1, 0), j+1) * A(n-1, k-j), j = 0..k) fi end: A(n,n) end:
seq(a(n), n = 0..16);  # Peter Luschny, Nov 20 2024

Table[Sum[(k!)^2*StirlingS2[n,k]^2,{k,0,n}],{n,0,20}] (* Vaclav Kotesovec, May 07 2014 *)

a(n) = sum(k=0, n, k!^2*stirling(n, k, 2)^2); \\ Michel Marcus, Mar 07 2020

from functools import cache
from math import comb as binomial
@cache
def A(n, k): return int(k == 0) if n == 0 else sum(binomial(k + int(j > 0), j + 1) * A(n - 1, k - j) for j in range(k + 1))
a = lambda n: A(n, n)
print([a(n) for n in range(17)])  # Peter Luschny, Nov 20 2024

E.g.f.: Sum_{n>=0} Sum_{j=0..n} (-1)^(n-j)*binomial(n,j)*(exp(j*x)-1)^n. a(n) = Sum_{k=0..n} Stirling2(n,k)*k!*A104602(k). - Vladeta Jovovic, Mar 25 2006
a(n) ~ sqrt(Pi/(1-log(2))) * n^(2*n+1/2) / (2*exp(2*n) * (log(2))^(2*n+1)). - Vaclav Kotesovec, May 09 2014
E.g.f.: Sum_{n>=0} (1 - exp(-n*x))^n * exp(-n*x). - Paul D. Hanna, Mar 26 2018
E.g.f.: Sum_{n>=0} (exp(n*x) - 1)^n * exp(-n*(n+1)*x). - Paul D. Hanna, Mar 26 2018
a(n) = A272644(2n,n). - Alois P. Heinz, Oct 17 2024
a(n) = A371761(n, n). - Peter Luschny, Nov 20 2024
a(n) = (n!)^2 * [(x*y)^n] 1 / (exp(x) + exp(y) - exp(x + y)). - Ilya Gutkovskiy, Apr 24 2025

A317855 Decimal expansion of a constant related to the asymptotics of A122400.

Original entry on oeis.org

3, 1, 6, 1, 0, 8, 8, 6, 5, 3, 8, 6, 5, 4, 2, 8, 8, 1, 3, 8, 3, 0, 1, 7, 2, 2, 0, 2, 5, 8, 8, 1, 3, 2, 4, 9, 1, 7, 2, 6, 3, 8, 2, 7, 7, 4, 1, 8, 8, 5, 5, 6, 3, 4, 1, 6, 2, 7, 2, 7, 8, 2, 0, 7, 5, 3, 7, 6, 9, 7, 0, 5, 9, 2, 1, 9, 3, 0, 4, 6, 1, 1, 2, 1, 9, 7, 5, 7, 4, 6, 8, 5, 4, 9, 7, 8, 4, 5, 9, 3, 2, 4, 2, 2, 7

Offset: 1

Vaclav Kotesovec, Aug 09 2018

			3.161088653865428813830172202588132491726382774188556341627278...

Cf. A121886, A122399, A122400, A122418, A122419, A122420, A227619, A232192, A243802, A244585, A248798, A317340, A326010.

Cf. A301584, A301585, A301586, A303056, A303057, A303654.

r = r /. FindRoot[E^(1/r)/r + (1 + E^(1/r)) * ProductLog[-E^(-1/r)/r] == 0, {r, 3/4}, WorkingPrecision -> 120]; RealDigits[(1 + Exp[1/r])*r^2][[1]]

r=solve(r=.8,1,exp(1/r)/r + (1+exp(1/r))*lambertw(-exp(-1/r)/r))
(1+exp(1/r))*r^2 \\ Charles R Greathouse IV, Jun 15 2021

Equals (1+exp(1/r))*r^2, where r = 0.873702433239668330496568304720719298213992... is the root of the equation exp(1/r)/r + (1+exp(1/r))*LambertW(-exp(-1/r)/r) = 0.

A320083 Expansion of e.g.f. Sum_{k>=0} log(1 + k*x)^k.

Original entry on oeis.org

1, 1, 7, 116, 3574, 177094, 12873962, 1290494904, 170592253320, 28753159552272, 6018433850602848, 1531605185388897552, 465706857941949607008, 166746568516127626614288, 69440517484503283491716400, 33278913978673363553703249408, 18185279212166784139689388753536, 11239676837467731657648932618952576

Offset: 0

Ilya Gutkovskiy, Oct 05 2018

nonn

Vaclav Kotesovec, Table of n, a(n) for n = 0..235

Cf. A048594, A048994, A122399, A317172, A320096.

1,seq(n!*coeff(series(add( log(1 + k*x)^k,k=1..100), x=0, 18), x, n), n=1..17); # Paolo P. Lava, Jan 09 2019

nmax = 17; CoefficientList[Series[1 + Sum[Log[1 + k x]^k, {k, 1, nmax}], {x, 0, nmax}], x] Range[0, nmax]!
Join[{1}, Table[Sum[StirlingS1[n, k] k! k^n, {k, n}], {n, 17}]]

a(n) = Sum_{k=0..n} Stirling1(n,k)*k!*k^n.

a(n) ~ c * d^n * n^(2*n + 1/2), where d = 0.298212940253960977992575968955431001807757948758929... and c = 3.40415549717199390989204785905061856492539214306... - Vaclav Kotesovec, Oct 05 2018

A229234 O.g.f.: Sum_{n>=0} n! * x^n / Product_{k=1..n} (1 - nkx).

Original entry on oeis.org

1, 1, 3, 19, 189, 2671, 50253, 1203679, 35548509, 1263153631, 52973381853, 2581493517439, 144317666200029, 9156299509121311, 653254398215833053, 51995430120141924799, 4585316010326597014749, 445304380297565009962591, 47368550666889620425580253, 5492643630110295899167573759

Offset: 0

Paul D. Hanna, Sep 17 2013

nonn

			O.g.f.: A(x) = 1 + x + 3*x^2 + 19*x^3 + 189*x^4 + 2671*x^5 + 50253*x^6 +...
where
A(x) = 1 + x/(1-x) + 2!*x^2/((1-2*1*x)*(1-2*2*x)) + 3!*x^3/((1-3*1*x)*(1-3*2*x)*(1-3*3*x)) + 4!*x^4/((1-4*1*x)*(1-4*2*x)*(1-4*3*x)*(1-4*4*x)) +...
Exponential Generating Function.
E.g.f.: E(x) = 1 + x + 3*x^2/2! + 19*x^3/3! + 189*x^4/4! + 2671*x^5/5! +...
where
E(x) = 1 + (exp(x)-1) + (exp(2*x)-1)^2/2^2 + (exp(3*x)-1)^3/3^3 + (exp(4*x)-1)^4/4^4 + (exp(5*x)-1)^5/5^5 +...

Seiichi Manyama, Table of n, a(n) for n = 0..300

Cf. A229233, A220181, A108459, A122399.

Cf. A229258, A229259, A229260, A229261.

Flatten[{1,Table[Sum[k^(n-k) * k! * StirlingS2[n, k],{k,0,n}],{n,1,20}]}] (* Vaclav Kotesovec, May 08 2014 *)

{a(n)=polcoeff(sum(m=0,n,m!*x^m/prod(k=1,m,1-m*k*x +x*O(x^n))),n)}
for(n=0,30,print1(a(n),", "))

{a(n)=n!*polcoeff(sum(m=0,n,(exp(m*x+x*O(x^n))-1)^m/m^m),n)}
for(n=0,30,print1(a(n),", "))

{a(n)=sum(k=0, n, k^(n-k) * k! * stirling(n, k, 2))}
for(n=0,30,print1(a(n),", "))

a(n) = Sum_{k=0..n} k^(n-k) * k! * Stirling2(n, k).

E.g.f.: Sum_{n>=0} (exp(n*x) - 1)^n / n^n.

A229260 O.g.f.: Sum_{n>=0} n! * n^(2n) x^n / Product_{k=1..n} (1 - n^2kx).

Original entry on oeis.org

1, 1, 33, 4759, 1812645, 1432421311, 2033196095973, 4707913008727279, 16598602853910799125, 84603008117292025844671, 598699398082553327852353413, 5694542805400507375406964870799, 70891082687197321771955383523878005, 1129717853570486718325946169950885995231

Offset: 0

Paul D. Hanna, Sep 17 2013

nonn

			O.g.f.: A(x) = 1 + x + 33*x^2 + 4759*x^3 + 1812645*x^4 + 1432421311*x^5 +...
where
A(x) = 1 + x/(1-x) + 2!*2^4*x^2/((1-2^2*1*x)*(1-2^2*2*x)) + 3!*3^6*x^3/((1-3^2*1*x)*(1-3^2*2*x)*(1-3^2*3*x)) + 4!*4^8*x^4/((1-4^2*1*x)*(1-4^2*2*x)*(1-4^2*3*x)*(1-4^2*4*x)) +...
Exponential Generating Function.
E.g.f.: E(x) = 1 + x + 33*x^2/2! + 4759*x^3/3! + 1812645*x^4/4! +...
where
E(x) = 1 + (exp(x)-1) + (exp(4*x)-1)^2 + (exp(9*x)-1)^3 + (exp(16*x)-1)^4 + (exp(25*x)-1)^5 + (exp(36*x)-1)^6 + (exp(49*x)-1)^7 +...

G. C. Greubel, Table of n, a(n) for n = 0..160

Cf. A229257, A229258, A229259, A229261, A229233, A229234, A220181, A122399.

Cf. A187755.

Flatten[{1,Table[Sum[k^(2*n) * k! * StirlingS2[n,k], {k,0,n}], {n,1,20}]}] (* Vaclav Kotesovec, May 08 2014 *)

{a(n)=polcoeff(sum(m=0,n,m!*m^(2*m)*x^m/prod(k=1,m,1-m^2*k*x +x*O(x^n))),n)}
for(n=0,20,print1(a(n),", "))

{a(n)=n!*polcoeff(sum(m=0,n,(exp(m^2*x+x*O(x^n))-1)^m),n)}
for(n=0,20,print1(a(n),", "))

{Stirling2(n, k)=n!*polcoeff(((exp(x+x*O(x^n))-1)^k)/k!, n)}
{a(n)=sum(k=0, n, k^(2*n) * k! * Stirling2(n, k))}
for(n=0,20,print1(a(n),", "))

a(n) = Sum_{k=0..n} k^(2*n) * k! * Stirling2(n, k).
E.g.f.: Sum_{n>=0} (exp(n^2*x) - 1)^n.
a(n) ~ c * d^n * (n!)^3 / n, where d = r^3*(1+exp(2/r)) = 7.8512435106631367719817991716164612615296980032514..., r = 0.94520217245242431308104743874492469552738... is the root of the equation (1+exp(-2/r))*LambertW(-exp(-1/r)/r) = -1/r, and c = 0.142680262107781025906560380273234930916319644... . - Vaclav Kotesovec, May 08 2014

A229261 O.g.f.: Sum_{n>=0} n^(2n) x^n / Product_{k=1..n} (1 - n^2kx).

Original entry on oeis.org

1, 1, 17, 922, 106695, 21742971, 6977367418, 3273755821827, 2129976884025085, 1846718792259030760, 2068516760060790309349, 2919795339100534415091143, 5088912154987483773753872912, 10766599670032172748225017763021, 27254500086981764567988714050736205

Offset: 0

Paul D. Hanna, Sep 17 2013

nonn

			O.g.f.: A(x) = 1 + x + 17*x^2 + 922*x^3 + 106695*x^4 + 21742971*x^5 +...
where
A(x) = 1 + x/(1-x) + 2^4*x^2/((1-2^2*1*x)*(1-2^2*2*x)) + 3^6*x^3/((1-3^2*1*x)*(1-3^2*2*x)*(1-3^2*3*x)) + 4^8*x^4/((1-4^2*1*x)*(1-4^2*2*x)*(1-4^2*3*x)*(1-4^2*4*x)) +...
Exponential Generating Function.
E.g.f.: E(x) = 1 + x + 17*x^2/2! + 922*x^3/3! + 106695*x^4/4! +...
where
E(x) = 1 + (exp(x)-1) + (exp(4*x)-1)^2/2! + (exp(9*x)-1)^3/3! + (exp(16*x)-1)^4/4! + (exp(25*x)-1)^5/5! + (exp(36*x)-1)^6/6! +...

Seiichi Manyama, Table of n, a(n) for n = 0..194

Cf. A229257, A229258, A229259, A229260, A229233, A229234, A220181, A122399.

Flatten[{1,Table[Sum[k^(2*n) * StirlingS2[n, k],{k,0,n}],{n,1,20}]}] (* Vaclav Kotesovec, May 08 2014 *)

{a(n)=polcoeff(sum(m=0,n,m^(2*m)*x^m/prod(k=1,m,1-m^2*k*x +x*O(x^n))),n)}
for(n=0,20,print1(a(n),", "))

{a(n)=n!*polcoeff(sum(m=0,n,(exp(m^2*x+x*O(x^n))-1)^m/m!),n)}
for(n=0,20,print1(a(n),", "))

{a(n)=sum(k=0, n, k^(2*n) * stirling(n, k, 2))}
for(n=0,20,print1(a(n),", "))

a(n) = Sum_{k=0..n} k^(2*n) * Stirling2(n, k).

E.g.f.: Sum_{n>=0} (exp(n^2*x) - 1)^n / n!.

A338040 E.g.f.: Sum_{j>=0} 4^j * (exp(j*x) - 1)^j.

Original entry on oeis.org

1, 4, 132, 11140, 1763076, 449262724, 168055179012, 86720706877060, 59029852191779076, 51241585497612147844, 55245853646893977682692, 72423868722672448652558980, 113447698393867318106045295876, 209271794145089904620369489016964

Offset: 0

Vaclav Kotesovec, Oct 08 2020

nonn

In general, if k > 0 and e.g.f.: Sum_{j>=0} k^j * (exp(j*x) - 1)^j, then a(n) ~ c * (1 + k*exp(1/r))^n * r^(2*n) * n!^2 / sqrt(n), where r is the root of the equation exp(1/r) * (1 + 1/(r*LambertW(-exp(-1/r)/r))) = -1/k and c is a constant (dependent only on k).

Conjecture: Let p be prime. The sequence obtained by reducing a(n) modulo p for n >= 1 is purely periodic with period p - 1. For example, modulo 7 the sequence becomes [4, 6, 3, 0, 1, 0, 4, 6, 3, 0, 1, 0, 4, 6, 3, 0, 1, 0, ...], with an apparent period of 6. - Peter Bala, May 31 2022

Seiichi Manyama, Table of n, a(n) for n = 0..207

Cf. A122399, A195005, A195263, A195415, A220181, A221077, A221078, A224899, A245322.

Cf. A122400, A301581, A301582, A301583.

Flatten[{1, Table[Sum[4^j * j^n * j! * StirlingS2[n, j], {j, 0, n}], {n, 1, 20}]}]
nmax = 20; CoefficientList[Series[1 + Sum[4^j*(Exp[j*x] - 1)^j, {j, 1, nmax}], {x, 0, nmax}], x] * Range[0, nmax]!

{a(n)=local(X=x+x*O(x^n)); n!*polcoeff(sum(m=0, n, 4^m*(exp(m*X)-1)^m), n)}

a(n) = Sum_{j=0..n} 4^j * j^n * j! * Stirling2(n,j).

a(n) ~ c * (1 + 4*exp(1/r))^n * r^(2*n) * n!^2 / sqrt(n), where r = 0.95894043087329419322124137165060249611787608513866855417024... is the root of the equation exp(1/r) * (1 + 1/(r*LambertW(-exp(-1/r)/r))) = -1/4 and c = 0.37483929689722634406486945426531890297038414869116425498643733178324...

cp's OEIS Frontend

A121886 a(n) = (1/n!)* Sum_{k=0..n} |Stirling1(n,k)|*A122399(k).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A220181 E.g.f.: Sum_{n>=0} (1 - exp(-n*x))^n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

PARI

PARI

PARI

PARI

Formula

A122400 Number of square (0,1)-matrices without zero rows and with exactly n entries equal to 1.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A048144 a(n) = Sum_{k=0..n} (k!)^2 * Stirling_2(n,k)^2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Python

Formula

A317855 Decimal expansion of a constant related to the asymptotics of A122400.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

PARI

Formula

A320083 Expansion of e.g.f. Sum_{k>=0} log(1 + k*x)^k.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A229234 O.g.f.: Sum_{n>=0} n! * x^n / Product_{k=1..n} (1 - n*k*x).

Views

Author

Keywords

Examples

Links

A229234 O.g.f.: Sum_{n>=0} n! * x^n / Product_{k=1..n} (1 - nkx).

A229260 O.g.f.: Sum_{n>=0} n! * n^(2n) x^n / Product_{k=1..n} (1 - n^2kx).

A229261 O.g.f.: Sum_{n>=0} n^(2n) x^n / Product_{k=1..n} (1 - n^2kx).