A124311 -id:A124311 - cp's OEIS frontend

A126390 a(n) = Sum_{i=0..n} 2^iB(i)binomial(n,i) where B(n) = Bell numbers A000110(n).

1, 3, 13, 71, 457, 3355, 27509, 248127, 2434129, 25741939, 291397789, 3510328695, 44782460313, 602513988107, 8518757813637, 126179029108463, 1952609274344353, 31492811964616163, 528249539951292461, 9197240228562763687, 165923214676585626729

Offset: 0

N. J. A. Sloane, Aug 04 2007

nonn

Vincenzo Librandi, Table of n, a(n) for n = 0..200
Toufik Mansour and Mark Shattuck, A recurrence related to the Bell numbers, INTEGERS 11 (2011), #A67.

Cf. A000110, A000296, A005493, A124311, A126617, A284859, A285064.

with(combstruct):seq(count(([S, {N=Union(Z, S, P), S=Set(Union(Z, P), card>=0), P=Set(Union(Z, Z), card>=1)}, labeled], size=n)), n=0..20); # Zerinvary Lajos, Mar 18 2008

Table[ Sum[ 2^k Binomial[n, k] BellB[k], {k, 0, n}], {n, 0, 30}] (* Karol A. Penson and Olivier Gérard, Oct 22 2007 *)

x='x+O('x^66); Vec(serlaplace((exp(exp(2*x)-1+x)))) \\ Joerg Arndt, May 13 2013

E.g.f.: exp(exp(2*x)-1+x). - Vladeta Jovovic, Aug 04 2007
a(n) = e^(-1)* 2^n * Sum_{k>=0} (k + 1/2)^n / k!. This is a Dobinski-type formula. - Karol A. Penson and Olivier Gérard, Oct 22 2007
G.f.: 1/Q(0), where Q(k)= 1 - (2*k+3)*x - 4*(k+1)*x^2/Q(k+1); (continued fraction). - Sergei N. Gladkovskii, May 03 2013
G.f.: 1/Q(0), where Q(k)= 1 - x - 2*x/(1 - 2*x*(2*k+1)/(1 - x - 2*x/(1 - 2*x*(2*k+2)/Q(k+1)))); (continued fraction). - Sergei N. Gladkovskii, May 13 2013
a(0) = 1; a(n) = a(n-1) + Sum_{k=1..n} binomial(n-1,k-1) * 2^k * a(n-k). - Ilya Gutkovskiy, Jun 21 2022
From Vaclav Kotesovec, Jun 22 2022: (Start)
a(n) ~ Bell(n) * (2 + LambertW(n)/n)^n.
a(n) ~ Bell(n) * 2^n * sqrt(n) * log(n)^(-1/2 + 1/(2*log(n)) - 1/(2*log(n)^2)) * exp(log(log(n))^2/(4*log(n)^2)). (End)
a(n) ~ 2^n * n^(n + 1/2) * exp(n/LambertW(n) - n - 1) / (sqrt(1 + LambertW(n)) * LambertW(n)^(n + 1/2)). - Vaclav Kotesovec, Jun 27 2022

A126617 a(n) = Sum_{i=0..n} (-2)^(n-i)B(i)binomial(n,i) where B(n) = Bell numbers A000110(n).

Original entry on oeis.org

1, -1, 2, -3, 7, -10, 31, -21, 204, 307, 2811, 12100, 74053, 432211, 2768858, 18473441, 129941283, 956187814, 7351696139, 58897405759, 490681196604, 4242903803727, 38014084430983, 352341755256348, 3373662303816313, 33326335433122711, 339232538387804530

Offset: 0

N. J. A. Sloane, Aug 04 2007

sign

a(n) is positive starting at n=8. - Karol A. Penson and Olivier Gérard, Oct 22 2007

Hankel transform is A000178. - Paul Barry, Apr 23 2009

			G.f.: 1 - 1*x + 2*x^2 - 3*x^3 + 7*x^4 - 10*x^5 + 31*x^6 - 21*x^7 + 204*x^8 + 307*x^9 + 2811*x^10 + 12100*x^11 + 74053*x^12 + 432211*x^13 + ...

Vincenzo Librandi, Table of n, a(n) for n = 0..200

Cf. A000110, A000296, A005493, A124311, A126390, A153732.

Table[ Sum[ (-2)^(n - k) Binomial[n, k] BellB[k], {k, 0, n}], {n, 0, 50}] (* Karol A. Penson and Olivier Gérard, Oct 22 2007 *)
With[{nn=30},CoefficientList[Series[Exp[Exp[x]-2x-1],{x,0,nn}],x] Range[0,nn]!] (* Harvey P. Dale, Jan 19 2025 *)

E.g.f.: exp(exp(x)-2*x-1). - Vladeta Jovovic, Aug 04 2007
a(n) = e^(-1) * Sum_{k>=0} (k-2)^n / k!. This is a Dobinski-type formula. - Karol A. Penson and Olivier Gérard, Oct 22 2007
G.f.: 1/(1+x-x^2/(1-2x^2/(1-x-3x^2/(1-2x-4x^2/(1-3x-5x^2/(1-.... (continued fraction). - Paul Barry, Apr 23 2009
Let A be the upper Hessenberg matrix of order n defined by: A[i,i-1]=-1, A[i,j]=binomial(j-1,i-1), (i<=j), and A[i,j]=0 otherwise. Then, for n>=1, a(n)=(-1)^(n)charpoly(A,2). - Milan Janjic, Jul 08 2010
G.f.: -1/U(0)  where U(k) = x*k - 1 - x - x^2*(k+1)/U(k+1); (continued fraction, 1-step). - Sergei N. Gladkovskii, Sep 28 2012
G.f.: 1/G(0) where G(k) = 1 + 2*x/(1 + 1/(1 - 2*x*(k+1)/G(k+1))); (continued fraction, 3-step). - Sergei N. Gladkovskii, Nov 23 2012
G.f.: G(0)/(1+3*x) where G(k) = 1 - 2*x*(k+1)/((2*k+1)*(2*x*k-2*x-1) - x*(2*k+1)*(2*k+3)*(2*x*k-2*x-1)/(x*(2*k+3) - 2*(k+1)*(2*x*k-x-1)/G(k+1) )); (recursively defined continued fraction). - Sergei N. Gladkovskii, Dec 19 2012
From Sergei N. Gladkovskii, Feb 13 2013: (Start)
Conjecture: if the e.g.f. is E(x)= exp( exp(x) -1 + p*x) then
g.f.: (x+1-p*x)/x/(G(0)-x) - 1/x where G(k) = 2*x + 1 - p*x - x*k + x*(x*k - x - 1 + p*x)/G(k+1); (continued fraction).
So, for this sequence (p=-2), g.f.: (3*x+1)/x/( G(0)-x ) - 1/x where G(k) = 4*x + 1 - x*k + x*(x*k - 3*x - 1)/G(k+1);
(End)
G.f.: 1/Q(0), where Q(k) = 1 + 2*x - x/(1 - x*(k+1)/Q(k+1)); (continued fraction). - Sergei N. Gladkovskii, Apr 22 2013
a(0) = 1; a(n) = -2 * a(n-1) + Sum_{k=0..n-1} binomial(n-1,k) * a(k). - Ilya Gutkovskiy, Jul 30 2021
a(n) ~ n^(n-2) * exp(n/LambertW(n) - n - 1) / (sqrt(1 + LambertW(n)) * LambertW(n)^(n-2)). - Vaclav Kotesovec, Jun 27 2022

More terms from Karol A. Penson and Olivier Gérard, Oct 22 2007

A337038 a(n) = exp(-1/2) * Sum_{k>=0} (2k - 1)^n / (2^k k!).

Original entry on oeis.org

1, 0, 2, 4, 20, 96, 552, 3536, 25104, 194816, 1637408, 14792768, 142761280, 1464117760, 15886137984, 181667507456, 2182268117248, 27456279388160, 360872502280704, 4943580063237120, 70437638474568704, 1041911242274562048, 15972832382065977344, 253388070573020401664

Offset: 0

Ilya Gutkovskiy, Aug 12 2020

nonn

Robert Israel, Table of n, a(n) for n = 0..516

Cf. A000296, A004211, A007405, A124311, A166922, A217203, A337039, A337040, A337041, A337042, A337043.

E:= exp((exp(2*x)-1)/2-x):
S:= series(E,x,31):
seq(coeff(S,x,i)*i!,i=0..30); # Robert Israel, Aug 26 2020

nmax = 23; CoefficientList[Series[Exp[(Exp[2 x] - 1)/2 - x], {x, 0, nmax}], x] Range[0, nmax]!
a[0] = 1; a[n_] := a[n] = Sum[Binomial[n - 1, k] 2^k a[n - k - 1], {k, 1, n - 1}]; Table[a[n], {n, 0, 23}]
Table[Sum[(-1)^(n - k) Binomial[n, k] 2^k BellB[k, 1/2], {k, 0, n}], {n, 0, 23}]

G.f. A(x) satisfies: A(x) = (1 - 2*x + x*A(x/(1 - 2*x))) / (1 - x - 2*x^2).
G.f.: (1/(1 + x)) * Sum_{k>=0} (x/(1 + x))^k / Product_{j=1..k} (1 - 2*j*x/(1 + x)).
E.g.f.: exp((exp(2*x) - 1) / 2 - x).
a(0) = 1; a(n) = Sum_{k=1..n-1} binomial(n-1,k) * 2^k * a(n-k-1).
a(n) = Sum_{k=0..n} (-1)^(n-k) * binomial(n,k) * A004211(k).
a(n) ~ 2^(n - 1/2) * n^(n - 1/2) * exp(n/LambertW(2*n) - n - 1/2) / (sqrt(1 + LambertW(2*n)) * LambertW(2*n)^(n - 1/2)). - Vaclav Kotesovec, Jun 26 2022

A187251 Number of permutations of [n] having no cycle with 3 or more alternating runs (it is assumed that the smallest element of a cycle is in the first position).

Original entry on oeis.org

1, 1, 2, 6, 22, 94, 460, 2532, 15420, 102620, 739512, 5729192, 47429896, 417429800, 3888426512, 38192416048, 394239339792, 4264424937488, 48212317486112, 568395755184224, 6973300915138656, 88860103591344864, 1174131206436335296, 16061756166912244800

Offset: 0

Emeric Deutsch, Mar 08 2011

nonn

a(n) = A187250(n,0).
It appears that a(n) = A216964(n,1), for n>0. - Michel Marcus, May 17 2013.
The above comment is correct. Let b(n) be the n-th element of the first column of the triangle in A216964. By definition, b(n) is the number of permutations of [n] with no cyclic valleys. Recall that alternating runs of permutations are monotonically increasing or decreasing subsequences. In other words, b(n) is the number of permutations of [n] with the restriction that every cycle has at most two alternating runs, so b(n) = A187251(n) = a(n). - Shi-Mei Ma, May 18 2013.

			a(4)=22 because only the permutations 3421=(1324) and 4312=(1423) have cycles with more than 2 alternating runs.

Alois P. Heinz, Table of n, a(n) for n = 0..528
Veronica Bitonti, Bishal Deb, and Alan D. Sokal, Thron-type continued fractions (T-fractions) for some classes of increasing trees, arXiv:2412.10214 [math.CO], 2024. See p. 56.

Cf. A001519, A187245, A187248, A187250, A216964.

Row sums of A344855.

g := exp((2*z-1+exp(2*z))*1/4): gser := series(g, z = 0, 28): seq(factorial(n)*coeff(gser, z, n), n = 0 .. 23);
# second Maple program:
a:= proc(n) option remember; `if`(n=0, 1, add(
      a(n-j)*binomial(n-1, j-1)*ceil(2^(j-2)), j=1..n))
    end:
seq(a(n), n=0..23);  # Alois P. Heinz, May 30 2021

nmax = 20; CoefficientList[Series[E^((2*x-1+E^(2*x))/4), {x, 0, nmax}], x] * Range[0, nmax]! (* Vaclav Kotesovec, Apr 17 2020 *)

a(n):=n!*sum(2^(n-2*k)*sum(binomial(k,j)*stirling2(n-k+j,j)*j!/(n-k+j)!,j,0,k)/k!,k,1,n); /* Vladimir Kruchinin, Apr 25 2011 */

x='x+O('x^66); Vec(serlaplace(exp( (2*x-1+exp(2*x))/4 ))) /* Joerg Arndt, Apr 26 2011 */

lista(m) = {P = x*y; for (n=1, m, M = subst(P, x, 1); M = subst(M, y, 1); print1(polcoeff(M, 0, q), ", "); P = (n*q+x*y)*P + 2*q*(1-q)*deriv(P, q)+ 2*x*(1-q)*deriv(P, x)+ (1-2*y+q*y)*deriv(P, y); ); } \\ (adapted from PARI prog in A216964) \\ Michel Marcus, May 17 2013

E.g.f.: exp( (2*z-1+exp(2*z))/4 ).
For n>=1: a(n)=n!*sum(k=1..n, 2^(n-2*k)*sum(j=0..k, binomial(k,j)*stirling2(n-k+j,j)*j!/(n-k+j)!)/k!); [From Vladimir Kruchinin, Apr 25 2011]
G.f.: 1/Q(0) where Q(k) =  1 - x*k - x/(1 - x*(k+1)/Q(k+1) ); (continued fraction). - Sergei N. Gladkovskii, Mar 07 2013
G.f.: 1/Q(0) where Q(k) = 1 - x*(2*k+1) - m*x^2*(k+1)/Q(k+1) and m=1 (continued fraction); setting m=2 gives A004211, m=4 gives A124311 without signs. - Sergei N. Gladkovskii, Sep 26 2013
G.f.: T(0)/(1-x), where T(k) = 1 - x^2*(k+1)/( x^2*(k+1) - (1-x-2*x*k)*(1-3*x-2*x*k)/T(k+1) ); (continued fraction). - Sergei N. Gladkovskii, Oct 25 2013
Sum_{k=0..n} binomial(n,k) * a(k) * a(n-k) = A007405(n). - Vaclav Kotesovec, Apr 17 2020
a(n) = Sum_{j=1..n} a(n-j)*binomial(n-1,j-1)*ceiling(2^(j-2)) for n > 0, a(0) = 1. - Alois P. Heinz, May 30 2021

A330605 a(n) = exp(-1) * Sum_{k>=0} (n*k - 1)^n / k!.

Original entry on oeis.org

1, 0, 5, 89, 2737, 121399, 7316101, 572218716, 56142822849, 6731180810945, 965898950508901, 163116461798211503, 31969444766902475185, 7187057932197297484108, 1834860441330563739401765, 527403671798720265634312349, 169396494914472404237224898305

Offset: 0

Ilya Gutkovskiy, Dec 19 2019

nonn

Cf. A000110, A000296, A124311, A292914, A307066, A330604.

Table[Exp[-1] Sum[(n k - 1)^n/k!, {k, 0, Infinity}], {n, 0, 16}]
Join[{1}, Table[Sum[(-1)^(n - k) Binomial[n, k] n^k BellB[k], {k, 0, n}], {n, 1, 16}]]
Table[n! SeriesCoefficient[Exp[Exp[n x] - x - 1], {x, 0, n}], {n, 0, 16}]

a(n) = n! * [x^n] exp(exp(n*x) - x - 1).

a(n) = Sum_{k=0..n} (-1)^(n - k) * binomial(n,k) * n^k * Bell(k).

A124312 Expansion of g.f. x^3*(1 - x)/(1 - x - x^2 - x^3 - x^4 - x^5).

Original entry on oeis.org

0, 0, 1, 0, 1, 2, 4, 8, 15, 30, 59, 116, 228, 448, 881, 1732, 3405, 6694, 13160, 25872, 50863, 99994, 196583, 386472, 759784, 1493696, 2936529, 5773064, 11349545, 22312618, 43865452, 86237208, 169537887, 333302710, 655255875, 1288199132

Offset: 1

Artur Jasinski, Oct 25 2006

Second column of the n-th power of pentanacci matrix {{1,1,1,1,1},{1,0,0,0,0}, {0,1,0,0,0}, {0,0,1,0,0}, {0,0,0,1,0}} read from bottom to top gives 5 numbers starting from position n.

a(n+5) equals the number of n-length binary words avoiding runs of zeros of lengths 5i+4, (i=0,1,2,...). - Milan Janjic, Feb 26 2015

Robert Israel, Table of n, a(n) for n = 1..3407
Martin Burtscher, Igor Szczyrba, and Rafał Szczyrba, Analytic Representations of the n-anacci Constants and Generalizations Thereof, Journal of Integer Sequences, Vol. 18 (2015), Article 15.4.5.
Index entries for linear recurrences with constant coefficients, signature (1,1,1,1,1).

Cf. A001591, A124311, A124313, A124314.

R:=PowerSeriesRing(Integers(), 50); [0,0] cat Coefficients(R!( x^3*(1-x)^2/(1-2*x+x^6) )); // G. C. Greubel, Aug 25 2023

f:= gfun:-rectoproc({a(n)+a(n+1)+a(n+2)+a(n+3)+a(n+4)-a(n+5), a(0) = 0, a(1) = 0, a(2) = 0, a(3) = 1, a(4) = 0}, a(n), remember):
seq(f(n),n=1..30); # Robert Israel, Apr 13 2017

CoefficientList[Series[(x^3-x^4)/(1-x-x^2-x^3-x^4-x^5), {x,0,50}], x]

def A124312_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P( x^2*(1-x)^2/(1-2*x+x^6) ).list()
A124312_list(50) # G. C. Greubel, Aug 25 2023

a(n) = A001591(n+1) - A001591(n). - Greg Dresden and Leo Zhang, Jun 20 2025

Edited by N. J. A. Sloane, Oct 29 2006, Jul 14 2007

Name corrected by Robert Israel, Apr 13 2017

A367786 Expansion of e.g.f. exp(exp(4*x) - x - 1).

Original entry on oeis.org

1, 3, 25, 235, 2737, 36947, 563657, 9542715, 176920417, 3555369635, 76820077945, 1772943290763, 43469116126737, 1127040956393203, 30779951676185385, 882453651485815003, 26480355971228530369, 829522636694530362691, 27064267045022876869337, 917751849133986186857003

Offset: 0

Ilya Gutkovskiy, Nov 30 2023

nonn

Cf. A000110, A000296, A124311, A285064, A285065, A330605, A367785.

nmax = 19; CoefficientList[Series[Exp[Exp[4 x] - x - 1], {x, 0, nmax}], x] Range[0, nmax]!
a[0] = 1; a[n_] := a[n] = -a[n - 1] + Sum[Binomial[n - 1, k - 1] 4^k a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 19}]
Table[Sum[(-1)^(n - k) Binomial[n, k] 4^k BellB[k], {k, 0, n}], {n, 0, 19}]

my(x='x+O('x^30)); Vec(serlaplace(exp(exp(4*x) - x - 1))) \\ Michel Marcus, Nov 30 2023

a(n) = exp(-1) * Sum_{k>=0} (4*k-1)^n / k!.
a(0) = 1; a(n) = -a(n-1) + Sum_{k=1..n} binomial(n-1,k-1) * 4^k * a(n-k).
a(n) = Sum_{k=0..n} (-1)^(n-k) * binomial(n,k) * 4^k * Bell(k).

A367785 Expansion of e.g.f. exp(exp(3*x) - x - 1).

Original entry on oeis.org

1, 2, 13, 89, 772, 7745, 87949, 1109288, 15332539, 229840361, 3706130914, 63857565095, 1169261937973, 22646779177898, 462143532144937, 9902312863237637, 222119823632283628, 5202170552214520637, 126914730275907871201, 3218552632981994910248, 84686139239808135094879, 2307953474037054591248501

Offset: 0

Ilya Gutkovskiy, Nov 30 2023

nonn

Cf. A000110, A000296, A124311, A247452, A284859, A284860, A330605, A367744, A367786.

nmax = 21; CoefficientList[Series[Exp[Exp[3 x] - x - 1], {x, 0, nmax}], x] Range[0, nmax]!
a[0] = 1; a[n_] := a[n] = -a[n - 1] + Sum[Binomial[n - 1, k - 1] 3^k a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 21}]
Table[Sum[(-1)^(n - k) Binomial[n, k] 3^k BellB[k], {k, 0, n}], {n, 0, 21}]

my(x='x+O('x^30)); Vec(serlaplace(exp(exp(3*x) - x - 1))) \\ Michel Marcus, Nov 30 2023

a(n) = exp(-1) * Sum_{k>=0} (3*k-1)^n / k!.
a(0) = 1; a(n) = -a(n-1) + Sum_{k=1..n} binomial(n-1,k-1) * 3^k * a(n-k).
a(n) = Sum_{k=0..n} (-1)^(n-k) * binomial(n,k) * 3^k * Bell(k).

A367743 Expansion of e.g.f. exp(1 - x - exp(2*x)).

Original entry on oeis.org

1, -3, 5, 1, -7, -75, -99, 1241, 10161, 18989, -332299, -3857551, -14440151, 141168997, 2807256333, 20182451657, -42073176479, -2999363709091, -38439478980891, -161835672017439, 3439471815545177, 87228227501354517, 937579822282327421, 216540362854403513, -198501712690150659055

Offset: 0

Ilya Gutkovskiy, Nov 29 2023

sign

Cf. A000587, A004211, A009235, A109747, A124311, A126390, A308536, A308645, A367744.

nmax = 24; CoefficientList[Series[Exp[1 - x - Exp[2 x]], {x, 0, nmax}], x] Range[0, nmax]!
a[0] = 1; a[n_] := a[n] = -a[n - 1] - Sum[Binomial[n - 1, k - 1] 2^k a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 24}]
Table[Sum[(-1)^(n - k) Binomial[n, k] 2^k BellB[k, -1], {k, 0, n}], {n, 0, 24}]

a(n) = exp(1) * Sum_{k>=0} (-1)^k * (2*k-1)^n / k!.
a(0) = 1; a(n) = -a(n-1) - Sum_{k=1..n} binomial(n-1,k-1) * 2^k * a(n-k).
a(n) = Sum_{k=0..n} (-1)^(n-k) * binomial(n,k) * 2^k * A000587(k).

A367938 Expansion of e.g.f. exp(exp(3x) - 1 - 2x).

Original entry on oeis.org

1, 1, 10, 55, 487, 4654, 51463, 632125, 8536492, 125279785, 1981246555, 33530245984, 603797462677, 11513675558701, 231539488842610, 4893151984630579, 108334206855000739, 2505977899186557502, 60419653270442268643, 1515077412621445514089, 39437350309301393464876, 1063746973172416765272589

Offset: 0

Ilya Gutkovskiy, Dec 05 2023

nonn

Cf. A000110, A124311, A126617, A247452, A284864, A367785, A367888.

nmax = 21; CoefficientList[Series[Exp[Exp[3 x] - 1 - 2 x], {x, 0, nmax}], x] Range[0, nmax]!
a[0] = 1; a[n_] := a[n] = -2 a[n - 1] + Sum[Binomial[n - 1, k - 1] 3^k a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 21}]
Table[Sum[Binomial[n, k] (-2)^(n - k) 3^k BellB[k], {k, 0, n}], {n, 0, 21}]

my(x='x+O('x^30)); Vec(serlaplace(exp(exp(3*x) - 1 - 2*x))) \\ Michel Marcus, Dec 07 2023

G.f. A(x) satisfies: A(x) = 1 - x * ( 2 * A(x) - 3 * A(x/(1 - 3*x)) / (1 - 3*x) ).
a(n) = exp(-1) * Sum_{k>=0} (3*k-2)^n / k!.
a(0) = 1; a(n) = -2 * a(n-1) + Sum_{k=1..n} binomial(n-1,k-1) * 3^k * a(n-k).
a(n) = Sum_{k=0..n} binomial(n,k) * (-2)^(n-k) * 3^k * Bell(k).

cp's OEIS Frontend

A126390 a(n) = Sum_{i=0..n} 2^i*B(i)*binomial(n,i) where B(n) = Bell numbers A000110(n).

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A126617 a(n) = Sum_{i=0..n} (-2)^(n-i)*B(i)*binomial(n,i) where B(n) = Bell numbers A000110(n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A337038 a(n) = exp(-1/2) * Sum_{k>=0} (2*k - 1)^n / (2^k * k!).

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A187251 Number of permutations of [n] having no cycle with 3 or more alternating runs (it is assumed that the smallest element of a cycle is in the first position).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Maxima

PARI

PARI

Formula

A330605 a(n) = exp(-1) * Sum_{k>=0} (n*k - 1)^n / k!.

Views

Author

Keywords

Crossrefs

Programs

Mathematica

Formula

A124312 Expansion of g.f. x^3*(1 - x)/(1 - x - x^2 - x^3 - x^4 - x^5).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

SageMath

Formula

Extensions

A367786 Expansion of e.g.f. exp(exp(4*x) - x - 1).

Views

Author

Keywords

Crossrefs

Programs

Mathematica

PARI

Formula

A126390 a(n) = Sum_{i=0..n} 2^iB(i)binomial(n,i) where B(n) = Bell numbers A000110(n).

A126617 a(n) = Sum_{i=0..n} (-2)^(n-i)B(i)binomial(n,i) where B(n) = Bell numbers A000110(n).

A337038 a(n) = exp(-1/2) * Sum_{k>=0} (2k - 1)^n / (2^k k!).

A367938 Expansion of e.g.f. exp(exp(3x) - 1 - 2x).