A133399 -id:A133399 - cp's OEIS frontend

A000248 Expansion of e.g.f. exp(x*exp(x)).

1, 1, 3, 10, 41, 196, 1057, 6322, 41393, 293608, 2237921, 18210094, 157329097, 1436630092, 13810863809, 139305550066, 1469959371233, 16184586405328, 185504221191745, 2208841954063318, 27272621155678841, 348586218389733556, 4605223387997411873

Offset: 0

N. J. A. Sloane, Simon Plouffe

Number of forests with n nodes and height at most 1.
Equivalently, number of idempotent mappings f from a set of n elements into itself (i.e., satisfying f o f = f). - Robert FERREOL, Oct 11 2007
In other words, a(n) = number of idempotents in the full semigroup of maps from [1..n] to itself. [Tainiter]
a(n) is the number of ways to select a set partition of {1,2,...,n} and then designate one element in each block (cell) of the partition.
Let set B have cardinality n. Then a(n) is the number of functions f:D->C over all partitions {D,C} of B. See the example in the Example Section below. We note that f:empty set->B is designated as the null function, whereas f:B->empty set is undefined unless B itself is empty. - Dennis P. Walsh, Dec 05 2013
In physics, a(n) would be interpreted as the number of projection operators P on S_n, i.e., ones satisfying P^2 = P. Example: a particle with a half-integer spin s has a spin space with 2s+1 base states which admits a(2s+1) linear projection operators (including the identity). These are important because they satisfy the operator identity exp(zU) = 1+(exp(z)-1)*U, valid for any complex z. - Stanislav Sykora, Nov 03 2016

			a(3)=10 since, for B={1,2,3}, we have 10 functions: 1 function of the type f:empty set->B; 6 functions of the type f:{x}->B\{x}; and 3 functions of the type f:{x,y}->B\{x,y}. - _Dennis P. Walsh_, Dec 05 2013

L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 91.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Problem 5.32(d).

Alois P. Heinz, Table of n, a(n) for n = 0..541 (first 101 terms from T. D. Noe)
Rudolf Berghammer, Jules Desharnais, and Michael Winter, Counting Specific Classes of Relations Regarding Fixed Points and Reflexive Points, arXiv:2505.00140 [cs.DM], 2025. See p. 24.
Alexander Burstein and Louis W. Shapiro, Pseudo-involutions in the Riordan group, arXiv:2112.11595 [math.CO], 2021.
Giulio Cerbai and Anders Claesson, Counting fixed-point-free Cayley permutations, arXiv:2507.09304 [math.CO], 2025. See p. 25.
Philippe Flajolet and Robert Sedgewick, Analytic Combinatorics, 2009; see page 131.
Xing Gao and William F. Keigher, Interlacing of Hurwitz series, Communications in Algebra, 45:5 (2017), 2163-2185, DOI: 10.1080/00927872.2016.1226885. See Ex. 2.13.
Bernhard Harris and Lowell Schoenfeld, The number of idempotent elements in symmetric semigroups, J. Combin. Theory, 3 (1967), 122-135.
Bernhard Harris and Lowell Schoenfeld, Asymptotic expansions for the coefficients of analytic functions, Illinois Journal of Mathematics, Volume 12, Issue 2 (1968), 264-277.
Gottfried Helms, Pascalmatrix tetrated
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 117
Vaclav Kotesovec, Graph - the asymptotic ratio (1000 terms)
Nate Kube and Frank Ruskey, Sequences That Satisfy a(n-a(n))=0, Journal of Integer Sequences, Vol. 8 (2005), Article 05.5.5.
John Riordan, Forests of labeled trees, J. Combin. Theory, 5 (1968), 90-103.
John Riordan, Letter to N. J. A. Sloane, Oct. 1970
John Riordan and N. J. A. Sloane, Correspondence, 1974
Emre Sen, Exceptional Sequences and Idempotent Functions, arXiv:1909.05887 [math.RT], 2019.
Melvin Tainiter, A characterization of idempotents in semigroups, J. Combinat. Theory, 5 (1968), 370-373.
Haoliang Wang and Robert Simon, The Analysis of Synchronous All-to-All Communication Protocols for Wireless Systems, Q2SWinet'18: Proceedings of the 14th ACM International Symposium on QoS and Security for Wireless and Mobile Networks (2018), 39-48.

First row of array A098697.
Row sums of A133399.
Column k=1 of A210725, A279636.
Column k=2 of A245501.
Cf. A005727, A048993.

m:=25; R:=PowerSeriesRing(Rationals(), m); b:=Coefficients(R!(Exp(x*Exp(x)))); [Factorial(n-1)*b[n]: n in [1..m]]; // Vincenzo Librandi, Feb 01 2020

A000248 := proc(n) local k; add(k^(n-k)*binomial(n, k), k=0..n); end; # Robert FERREOL, Oct 11 2007
a:= proc(n) option remember; if n=0 then 1 else add(binomial(n-1, j) *(j+1) *a(n-1-j), j=0..n-1) fi end: seq(a(n), n=0..20); # Zerinvary Lajos, Mar 28 2009

CoefficientList[Series[Exp[x Exp[x]],{x,0,20}],x]*Table[n!,{n,0,20}]
a[0] = 1; a[1] = 1; a[n_] := a[n] = a[n - 1] + Sum[(Binomial[n - 1, j] + (n - 1) Binomial[n - 2, j]) a[j], {j, 0, n - 2}]; Table[a[n], {n, 0, 20}] (* David Callan, Oct 04 2013 *)
Flatten[{1,Table[Sum[Binomial[n,k]*(n-k)^k,{k,0,n}],{n,1,20}]}] (* Vaclav Kotesovec, Jul 13 2014 *)
Table[Sum[BellY[n, k, Range[n]], {k, 0, n}], {n, 0, 20}] (* Vladimir Reshetnikov, Nov 09 2016 *)

a(n)=sum(k=0,n,binomial(n,k)*(n-k)^k); \\ Paul D. Hanna, Jun 26 2009

x='x+O('x^66); Vec(serlaplace(exp(x*exp(x)))) \\ Joerg Arndt, Oct 06 2013

# uses[bell_matrix from A264428]
B = bell_matrix(lambda k: k+1, 20)
print([sum(B.row(n)) for n in range(20)]) # Peter Luschny, Sep 03 2019

G.f.: Sum_{k>=0} x^k/(1-k*x)^(k+1). - Vladeta Jovovic, Oct 25 2003
a(n) = Sum_{k=0..n} C(n,k)*(n-k)^k. - Paul D. Hanna, Jun 26 2009
G.f.: G(0) where G(k) = 1 - x*(-1+2*k*x)^(2*k+1)/((x-1+2*k*x)^(2*k+2) - x*(x-1+2*k*x)^(4*k+4)/(x*(x-1+2*k*x)^(2*k+2) - (2*x-1+2*k*x)^(2*k+3)/G(k+1))) (continued fraction). - Sergei N. Gladkovskii, Jan 26 2013
E.g.f.: 1 + x/(1+x)*(G(0) - 1) where G(k) = 1 + exp(x)/(k+1)/(1-x/(x+(1)/G(k+1))) (continued fraction). - Sergei N. Gladkovskii, Feb 04 2013
Recurrence: a(0)=1, a(n) = Sum_{k=1..n} binomial(n-1,k-1)*k*a(n-k). - James East, Mar 30 2014
Asymptotics (Harris and Schoenfeld, 1968): a(n) ~ sqrt((r+1)/(2*Pi*(n+1)*(r^2+3*r+1))) * n! * exp((n+1)/(r+1)) / r^n, where r is the root of the equation r*(r+1)*exp(r) = n+1. - Vaclav Kotesovec, Jul 13 2014
a(n) = Sum_{k=0..n} A005727(k)*Stirling2(n, k). - Mélika Tebni, Jun 12 2022
More precise asymptotics: a(n) ~ n^(n + 1/2) / (sqrt(1 + 3*r + r^2) * exp(n - r*exp(r) + r/2) * r^(n + 1/2)), where r = 2*w - 1/(2*w) + 5/(8*w^2) - 19/(24*w^3) + 209/(192*w^4) - 763/(480*w^5) + 4657/(1920*w^6) - 6855/(1792*w^7) + 199613/(32256*w^8) + ... and w = LambertW(sqrt(n)/2). - Vaclav Kotesovec, Feb 20 2023

In view of the multiple appearances of this sequence, I replaced the definition with the simple exponential generating function. - N. J. A. Sloane, Apr 16 2018

A058877 Number of labeled acyclic digraphs with n nodes containing exactly n-1 points of in-degree zero.

Original entry on oeis.org

0, 2, 9, 28, 75, 186, 441, 1016, 2295, 5110, 11253, 24564, 53235, 114674, 245745, 524272, 1114095, 2359278, 4980717, 10485740, 22020075, 46137322, 96468969, 201326568, 419430375, 872415206, 1811939301, 3758096356, 7784628195, 16106127330, 33285996513

Offset: 1

N. J. A. Sloane, Jan 07 2001

Convolution of 2^n+1 (A000051) and 2^n-1 (A000225). - Graeme McRae, Jun 07 2006
Let Q be a binary relation on the power set P(A) of a set A having n = |A| elements such that for all nonempty elements x,y of P(A), xRy if x is a proper subset of y and there are no z in P(A) such that x is a proper subset of z and z is a proper subset of y. Then a(n) = |Q|. - Ross La Haye, Feb 20 2008, Oct 21 2008
Also: convolution of A006589 with A000012 (i.e., partial sums of A006589). - R. J. Mathar, Jan 25 2009
The La Haye binary relation Q is more clearly stated as x is nonempty and y has one more element than x. If x is a k-set than the number of such pairs is binomial( n, k) * (n-k). - Michael Somos, Mar 29 2012
Select one of the n nodes of the digraph and select a nonempty subset of the rest to connect to the selected node. This can be done in n * (2^(n-1) - 1) ways. - Michael Somos, Mar 29 2012
Column 1 of A198204. - Peter Bala, Aug 01 2012
a(n) is the number of ternary sequences of length n that contain one 0 and at least one 1.  For example, a(3)=9 since the sequences are the 3 permutations of 011 and the 6 permutations of 012. - Enrique Navarrete, Apr 05 2021
a(n) is also the number of multiplications required to compute the permanent of general n X n matrices using canonical trellis method (see Theorem 5, p. 10 in Kiah et al.). - Stefano Spezia, Nov 02 2021

			G.f. = 2*x^2 + 9*x^3 + 28*x^4 + 75*x^5 + 186*x^6 + 441*x^7 + 1016*x^8 + ...

F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 19, (1.6.4).
Gerta Rucker and Christoph Rucker, "Walk counts, Labyrinthicity and complexity of acyclic and cyclic graphs and molecules", J. Chem. Inf. Comput. Sci., 40 (2000), 99-106. See Table 1 on page 101. [From Parthasarathy Nambi, Sep 26 2008]

Vincenzo Librandi, Table of n, a(n) for n = 1..2001
Jia Huang and Erkko Lehtonen, Associative-commutative spectra for some varieties of groupoids, arXiv:2401.15786 [math.CO], 2024. See p. 12.
Han Mao Kiah, Alexander Vardy and Hanwen Yao, Computing Permanents on a Trellis, arXiv:2107.07377 [cs.IT], 2021.
Tamás Szakács, Convolution of second order linear recursive sequences. II. Commun. Math. 25, No. 2, 137-148 (2017), remark 3.
Tamás Szakács, Linear recursive sequences and factorials, Ph. D. Thesis, Univ. Debrecen (Hungary, 2024). See p. 36.
Index entries for linear recurrences with constant coefficients, signature (6,-13,12,-4).

Second column of A058876. Cf. A003025, A003026.
Column k=1 of A133399.
Cf. A198204.

[(n+1)*2^n-n-1: n in [0..30]]; // Vincenzo Librandi, Sep 26 2011

[seq (stirling2(n,2)*n,n=1..29)]; # Zerinvary Lajos, Dec 06 2006
a:=n->sum(k*binomial(n,k), k=2..n): seq(a(n), n=1..29); # Zerinvary Lajos, May 08 2007

Table[(n+1)*2^n-n-1, {n, 0, 200}] (* Vladimir Joseph Stephan Orlovsky, Jun 30 2011 *)
a[ n_] := Sum[ Binomial[ n, k] (n - k), {k, n-1}]; (* Michael Somos, Mar 29 2012 *)

{a(n) = if( n<1, 0, n * (2^(n-1) - 1))} /* Michael Somos, Mar 29 2012 */

[stirling_number2(i,2)*i for i in range(1,26)] # Zerinvary Lajos, Jun 27 2008

[(n+1)*gaussian_binomial(n,1,2) for n in range(0,29)] # Zerinvary Lajos, May 31 2009

a(n+1) = (n+1)*2^n - n - 1 = Sum_{j=0..n} (n+j)*2^(n-j-1) = A048493(n)-1 = Column sum of A062111. - Henry Bottomley, May 30 2001
From R. J. Mathar, Jan 25 2009: (Start)
G.f.: x^2*(2-3*x)/((1-2*x)*(1-x))^2.
a(n) = 6*a(n-1) - 13*a(n-2) + 12*a(n-3) - 4*a(n-4). (End)
a(n) = Sum_{k=1..n-1} binomial(n, k) * (n-k). - Michael Somos, Mar 29 2012
E.g.f: x*exp(x)*(exp(x)-1). - Enrique Navarrete, Apr 05 2021

More terms from Vladeta Jovovic, Apr 10 2001

A198204 Series reversion of (1 - tx)log(1 + x) with respect to x.

Original entry on oeis.org

1, 1, 2, 1, 9, 12, 1, 28, 120, 120, 1, 75, 750, 2100, 1680, 1, 186, 3780, 21840, 45360, 30240, 1, 441, 16856, 176400, 705600, 1164240, 665280, 1, 1016, 69552, 1224720, 8316000, 25280640, 34594560, 17297280, 1, 2295, 272250, 7692300, 82577880, 408648240, 998917920, 1167566400, 518918400

Offset: 1

Peter Bala, Jul 31 2012

This triangle is A133399 read by diagonals.

			Triangle begins
.n\k.|..0....1.....2......3......4......5
= = = = = = = = = = = = = = = = = = = = =
..1..|..1
..2..|..1....2
..3..|..1....9....12
..4..|..1...28...120....120
..5..|..1...75...750...2100...1680
..6..|..1..186..3780..21840..45360..30240
...

Cf. A001813, A002691, A052892, A058877, A133386, A133399, A141618.

Flatten[CoefficientList[CoefficientList[InverseSeries[Series[Log[1 + x]*(1 - t*x),{x,0,9}]], x]*Table[n!, {n,0,9}], t]] (* Peter Luschny, Oct 25 2015 *)

T(n,k) = k!*binomial(n + k - 1,k)*Stirling2(n,k + 1) (n >= 1, k >=0).
E.g.f.: A(x,t) = series reversion of (1 - t*x)*log(1 + x) w.r.t. x = x + (1 + 2*t)*x^2/2! + (1 + 9*t + 12*t^2)*x^3/3! + ....
Main diagonal A001813, first subdiagonal A002691.
Column 1 A058877, column 2 A133386. Row sums A052892.
1 - t*A(x,t) = x/series reversion of x*(1 - t(exp(x) - 1)) with respect to x. Cf. A141618. - Peter Bala, Oct 22 2015

A133386 Number of forests of labeled rooted trees with n nodes, containing exactly 2 trees of height one, all others having height zero.

Original entry on oeis.org

0, 0, 0, 0, 12, 120, 750, 3780, 16856, 69552, 272250, 1026300, 3762132, 13498056, 47615750, 165683700, 570024240, 1942538592, 6566094450, 22038141420, 73510278380, 243854707320, 804962754750, 2645408201700, 8658857196552, 28237920483600, 91778694166250

Offset: 0

Alois P. Heinz, Nov 22 2007

nonn

			a(4) = 12 because 12 trees of the given kind exist: 1<-3 2<-4, 1<-4 2<-3, 1<-2 3<-4, 1<-4 3<-2, 1<-2 4<-3, 1<-3 4<-2, 2<-1 3<-4, 2<-4 3<-1, 2<-1 4<-3, 2<-3 4<-1, 3<-1 4<-2 and 3<-2 4<-1.

Alois P. Heinz, Table of n, a(n) for n = 0..650
A. P. Heinz, Finding Two-Tree-Factor Elements of Tableau-Defined Monoids in Time O(n^3), Ed. S. G. Akl, F. Fiala, W. W. Koczkodaj: Advances in Computing and Information, ICCI90 Niagara Falls, LNCS 468, Springer-Verlag (1990), pp. 120-128.
Index entries for linear recurrences with constant coefficients, signature (18,-141,630,-1767,3222,-3815,2826,-1188,216).

Cf. A058877, A000248.
Column k=2 of A133399.
Column 2 of A198204. - Peter Bala, Aug 01 2012

a:= n-> n*(n-1)*Stirling2(n-1, 3):
seq(a(n), n=0..50);

Join[{0},Table[n(n-1)StirlingS2[n-1,3],{n,30}]] (* or *) LinearRecurrence[{18,-141,630,-1767,3222,-3815,2826,-1188,216},{0,0,0,0,12,120,750,3780,16856},30] (* Harvey P. Dale, May 02 2015 *)

a(n) = n*(n-1) * Stirling2(n-1,3).
G.f.: -2*x^4*(85*x^4-180*x^3+141*x^2-48*x+6) / ((x-1)^3*(3*x-1)^3*(2*x-1)^3). - Maksym Voznyy (voznyy(AT)mail.ru), Jul 27 2009
a(0)=0, a(1)=0, a(2)=0, a(3)=0, a(4)=12, a(5)=120, a(6)=750, a(7)=3780, a(8)=16856, a(n)=18*a(n-1)-141*a(n-2)+630*a(n-3)-1767*a(n-4)+ 3222*a(n-5)- 3815*a(n-6)+2826*a(n-7)-1188*a(n-8)+216*a(n-9). - Harvey P. Dale, May 02 2015

cp's OEIS Frontend

A000248 Expansion of e.g.f. exp(x*exp(x)).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

PARI

Sage

Formula

Extensions

A058877 Number of labeled acyclic digraphs with n nodes containing exactly n-1 points of in-degree zero.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Sage

Formula

Extensions

A198204 Series reversion of (1 - t*x)*log(1 + x) with respect to x.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A133386 Number of forests of labeled rooted trees with n nodes, containing exactly 2 trees of height one, all others having height zero.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A198204 Series reversion of (1 - tx)log(1 + x) with respect to x.