A006351 -id:A006351 - cp's OEIS frontend

A000311 Schroeder's fourth problem; also series-reduced rooted trees with n labeled leaves; also number of total partitions of n.

0, 1, 1, 4, 26, 236, 2752, 39208, 660032, 12818912, 282137824, 6939897856, 188666182784, 5617349020544, 181790703209728, 6353726042486272, 238513970965257728, 9571020586419012608, 408837905660444010496, 18522305410364986906624

Offset: 0

N. J. A. Sloane

a(n) is the number of labeled series-reduced rooted trees with n leaves (root has degree 0 or >= 2); a(n-1) = number of labeled series-reduced trees with n leaves. Also number of series-parallel networks with n labeled edges, divided by 2.
A total partition of n is essentially what is meant by the first part of the previous line: take the numbers 12...n, and partition them into at least two blocks. Partition each block with at least 2 elements into at least two blocks. Repeat until only blocks of size 1 remain. (See the reference to Stanley, Vol. 2.) - N. J. A. Sloane, Aug 03 2016
Polynomials with coefficients in triangle A008517, evaluated at 2. - Ralf Stephan, Dec 13 2004
Row sums of unsigned A134685. - Tom Copeland, Oct 11 2008
Row sums of A134991, which contains an e.g.f. for this sequence and its compositional inverse. - Tom Copeland, Jan 24 2018
From Gus Wiseman, Dec 28 2019: (Start)
Also the number of singleton-reduced phylogenetic trees with n labels. A phylogenetic tree is a series-reduced rooted tree whose leaves are (usually disjoint) nonempty sets. It is singleton-reduced if no non-leaf node covers only singleton branches. For example, the a(4) = 26 trees are:
  {1,2,3,4}  {{1},{2},{3,4}}  {{1},{2,3,4}}
             {{1},{2,3},{4}}  {{1,2},{3,4}}
             {{1,2},{3},{4}}  {{1,2,3},{4}}
             {{1},{2,4},{3}}  {{1,2,4},{3}}
             {{1,3},{2},{4}}  {{1,3},{2,4}}
             {{1,4},{2},{3}}  {{1,3,4},{2}}
                              {{1,4},{2,3}}
                              {{{1},{2,3}},{4}}
                              {{{1,2},{3}},{4}}
                              {{1},{{2},{3,4}}}
                              {{1},{{2,3},{4}}}
                              {{{1},{2,4}},{3}}
                              {{{1,2},{4}},{3}}
                              {{1},{{2,4},{3}}}
                              {{{1,3},{2}},{4}}
                              {{{1},{3,4}},{2}}
                              {{{1,3},{4}},{2}}
                              {{{1,4},{2}},{3}}
                              {{{1,4},{3}},{2}}
(End)

			E.g.f.: A(x) = x + x^2/2! + 4*x^3/3! + 26*x^4/4! + 236*x^5/5! + 2752*x^6/6! + ...
where exp(A(x)) = 1 - x + 2*A(x), and thus
Series_Reversion(A(x)) = x - x^2/2! - x^3/3! - x^4/4! - x^5/5! - x^6/6! + ...
O.g.f.: G(x) = x + x^2 + 4*x^3 + 26*x^4 + 236*x^5 + 2752*x^6 + 39208*x^7 + ...
where
G(x) = x/2 + x/(2*(2-x)) + x/(2*(2-x)*(2-2*x)) + x/(2*(2-x)*(2-2*x)*(2-3*x)) + x/(2*(2-x)*(2-2*x)*(2-3*x)*(2-4*x)) + x/(2*(2-x)*(2-2*x)*(2-3*x)*(2-4*x)*(2-5*x)) + ...
From _Gus Wiseman_, Dec 28 2019: (Start)
A rooted tree is series-reduced if it has no unary branchings, so every non-leaf node covers at least two other nodes. The a(4) = 26 series-reduced rooted trees with 4 labeled leaves are the following. Each bracket (...) corresponds to a non-leaf node.
  (1234)  ((12)34)  ((123)4)
          (1(23)4)  (1(234))
          (12(34))  ((124)3)
          (1(24)3)  ((134)2)
          ((13)24)  (((12)3)4)
          ((14)23)  ((1(23))4)
                    ((12)(34))
                    (1((23)4))
                    (1(2(34)))
                    (((12)4)3)
                    ((1(24))3)
                    (1((24)3))
                    (((13)2)4)
                    ((13)(24))
                    (((13)4)2)
                    ((1(34))2)
                    (((14)2)3)
                    ((14)(23))
                    (((14)3)2)
(End)

L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 224.
J. Felsenstein, Inferring phyogenies, Sinauer Associates, 2004; see p. 25ff.
L. R. Foulds and R. W. Robinson, Enumeration of phylogenetic trees without points of degree two. Ars Combin. 17 (1984), A, 169-183. Math. Rev. 85f:05045
T. S. Motzkin, Sorting numbers for cylinders and other classification numbers, in Combinatorics, Proc. Symp. Pure Math. 19, AMS, 1971, pp. 167-176.
J. Riordan, Combinatorial Identities, Wiley, 1968, p. 197.
E. Schroeder, Vier combinatorische Probleme, Z. f. Math. Phys., 15 (1870), 361-376.
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 "total partitions", Example 5.2.5, Equation (5.27), and also Fig. 5-3 on page 14. See also the Notes on page 66.

N. J. A. Sloane, Table of n, a(n) for n = 0..375 [Shortened file because terms grow rapidly: see Sloane link below for additional terms]
Mohamed Barakat, Reimer Behrends, Christopher Jefferson, Lukas Kühne, and Martin Leuner, On the generation of rank 3 simple matroids with an application to Terao's freeness conjecture, arXiv:1907.01073 [math.CO], 2019.
Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin, Mickaël Maazoun, and Adeline Pierrot, Random cographs: Brownian graphon limit and asymptotic degree distribution, arXiv:1907.08517 [math.CO], 2019.
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. 58.
A. Blass, N. Dobrinen, and D. Raghavan, The next best thing to a P-point, arXiv preprint arXiv:1308.3790 [math.LO], 2013.
P. J. Cameron, Some treelike objects, Quart. J. Math. Oxford, 38 (1987), 155-183. MR0891613 (89a:05009). See p. 155 and 159.
P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.
L. Carlitz and J. Riordan, The number of labeled two-terminal series-parallel networks, Duke Math. J. 23 (1956), 435-445 (the sequence called {A_n}).
Tom Copeland, Comments on A000311
Brian Drake, Ira M. Gessel, and Guoce Xin, Three Proofs and a Generalization of the Goulden-Litsyn-Shevelev Conjecture on a Sequence Arising in Algebraic Geometry, J. of Integer Sequences, Vol. 10 (2007), Article 07.3.7
John Engbers, David Galvin, and Clifford Smyth, Restricted Stirling and Lah numbers and their inverses, arXiv:1610.05803 [math.CO], 2016.
J. Felsenstein, The number of evolutionary trees, Systematic Zoology, 27 (1978), 27-33. (Annotated scanned copy)
J. Felsenstein, The number of evolutionary trees, Systematic Biology, 27 (1978), pp. 27-33, 1978.
S. R. Finch, Series-parallel networks, July 7, 2003. [Cached copy, with permission of the author]
Steven R. Finch, Mathematical Constants II, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, Cambridge, 2018.
Philippe Flajolet, A Problem in Statistical Classification Theory
P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009; see page 129
Daniel L. Geisler, Combinatorics of Iterated Functions
M. D. Hendy, C. H. C. Little, David Penny, Comparing trees with pendant vertices labelled, SIAM J. Appl. Math. 44 (5) (1984) Table 1
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 69
D. Jackson, A. Kempf, and A. Morales, A robust generalization of the Legendre transform for QFT, arXiv:1612.0046 [hep-th], 2017.
V. P. Johnson, Enumeration Results on Leaf Labeled Trees, Ph. D. Dissertation, Univ. Southern Calif., 2012.
B. R. Jones, On tree hook length formulas, Feynman rules and B-series, Master's thesis, Simon Fraser University, 2014.
Vladimir V. Kruchinin, The method for obtaining expressions for coefficients of reverse generating functions, arXiv:1211.3244 [math.CO], 2012.
Z. A. Lomnicki, Two-terminal series-parallel networks, Adv. Appl. Prob., 4 (1972), 109-150.
Shi-Mei Ma, Jun-Ying Liu, Jean Yeh, and Yeong-Nan Yeh, Eulerian-type polynomials over Stirling permutations and box sorting algorithm, arXiv:2506.16438 [math.CO], 2025. See p. 5.
Dragan Mašulović, Big Ramsey spectra of countable chains, arXiv:1912.03022 [math.CO], 2019.
Arnau Mir, Francesc Rossello, and Lucia Rotger, Sound Colless-like balance indices for multifurcating trees, arXiv:1805.01329 [q-bio.PE], 2018.
J. W. Moon, Some enumerative results on series-parallel networks, Annals Discrete Math., 33 (1987), 199-226.
T. S. Motzkin, Sorting numbers for cylinders and other classification numbers, in Combinatorics, Proc. Symp. Pure Math. 19, AMS, 1971, pp. 167-176. [Annotated, scanned copy]
F. Murtagh, Counting dendrograms: a survey, Discrete Appl. Math., 7 (1984), 191-199.
Andrew Elvey Price and Alan D. Sokal, Phylogenetic trees, augmented perfect matchings, and a Thron-type continued fraction (T-fraction) for the Ward polynomials, arXiv:2001.01468 [math.CO], 2020.
P. Regner, Phylogenetic Trees: Selected Combinatorial Problems, Master's Thesis, 2012, Institute of Discrete Mathematics and Geometry, TU Vienna, pp. 50-59.
J. Riordan, Letter to N. J. A. Sloane, Jul. 1970
J. Riordan, The blossoming of Schröder's fourth problem, Acta Math., 137 (1976), 1-16.
E. Schröder, Vier combinatorische Probleme, Z. f. Math. Phys., 15 (1870), 361-376. [Annotated scanned copy]
N. J. A. Sloane, Table of n, a(n) for n = 0..500
J. Taylor, Formal group laws and hypergraph colorings, doctoral thesis, Univ. of Wash., 2016, p. 95. [_Tom Copeland_, Dec 20 2018]
Elena L. Wang and Guoce Xin, On Ward Numbers and Increasing Schröder Trees, arXiv:2507.15654 [math.CO], 2025. See pp. 2, 12.
Index entries for sequences related to trees
Index entries for sequences related to rooted trees
Index entries for "core" sequences
Index entries for sequences mentioned in Moon (1987)
Index entries for sequences related to parenthesizing

Row sums of A064060 and A134991.
The unlabeled version is A000669.
Unlabeled phylogenetic trees are A141268.
The node-counting version is A060356, with unlabeled version A001678.
Phylogenetic trees with n labels are A005804.
Chains of set partitions are A005121, with maximal version A002846.
Inequivalent leaf-colorings of series-reduced rooted trees are A318231.
Cf. A001003, A007827, A005805, A006351, A000084.
For n >= 2, A000311(n) = A006351(n)/2 = A005640(n)/2^(n+1).
Cf. A000110, A000669 = unlabeled hierarchies, A119649.
Cf. A000670, A135494, A134685.
Cf. A048816, A196545, A213427, A316651, A316652, A330626, A330627.
Cf. A000169, A042977, A133314, A134685, A269939.

M:=499; a:=array(0..500); a[0]:=0; a[1]:=1; a[2]:=1; for n from 0 to 2 do lprint(n,a[n]); od: for n from 2 to M do a[n+1]:=(n+2)*a[n]+2*add(binomial(n,k)*a[k]*a[n-k+1],k=2..n-1); lprint(n+1,a[n+1]); od:
Order := 50; t1 := solve(series((exp(A)-2*A-1),A)=-x,A); A000311 := n-> n!*coeff(t1,x,n);
# second Maple program:
b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
      add(combinat[multinomial](n, n-i*j, i$j)/j!*
      a(i)^j*b(n-i*j, i-1), j=0..n/i)))
    end:
a:= n-> `if`(n<2, n, b(n, n-1)):
seq(a(n), n=0..40);  # Alois P. Heinz, Jan 28 2016
# faster program:
b:= proc(n, i) option remember;
    `if`(i=0 and n=0, 1, `if`(i<=0 or i>n, 0,
    i*b(n-1, i) + (n+i-1)*b(n-1, i-1))) end:
a:= n -> `if`(n<2, n, add(b(n-1, i), i=0..n-1)):
seq(a(n), n=0..40);  # Peter Luschny, Feb 15 2021

nn = 19; CoefficientList[ InverseSeries[ Series[1+2a-E^a, {a, 0, nn}], x], x]*Range[0, nn]! (* Jean-François Alcover, Jul 21 2011 *)
a[ n_] := If[ n < 1, 0, n! SeriesCoefficient[ InverseSeries[ Series[ 1 + 2 x - Exp[x], {x, 0, n}]], n]]; (* Michael Somos, Jun 04 2012 *)
a[n_] := (If[n < 2,n,(column = ConstantArray[0, n - 1]; column[[1]] = 1; For[j = 3, j <= n, j++, column = column * Flatten[{Range[j - 2], ConstantArray[0, (n - j) + 1]}] + Drop[Prepend[column, 0], -1] * Flatten[{Range[j - 1, 2*j - 3], ConstantArray[0, n - j]}];]; Sum[column[[i]], {i, n - 1}]  )]); Table[a[n], {n, 0, 20}] (* Peter Regner, Oct 05 2012, after a formula by Felsenstein (1978) *)
multinomial[n_, k_List] := n!/Times @@ (k!); b[n_, i_] := b[n, i] = If[n == 0, 1, If[i<1, 0, Sum[multinomial[n, Join[{n-i*j}, Array[i&,j]]]/j!*a[i]^j *b[n-i*j, i-1], {j, 0, n/i}]]]; a[n_] := If[n<2, n, b[n, n-1]]; Table[ a[n], {n, 0, 40}] (* Jean-François Alcover, Feb 07 2016, after Alois P. Heinz *)
sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
mtot[m_]:=Prepend[Join@@Table[Tuples[mtot/@p],{p,Select[sps[m],1Gus Wiseman, Dec 28 2019 *)
(* Lengthy but easy to follow *)
  lead[, n /; n < 3] := 0
  lead[h_, n_] := Module[{p, i},
        p = Position[h, {_}];
        Sum[MapAt[{#, n} &, h, p[[i]]], {i, Length[p]}]
        ]
  follow[h_, n_] := Module[{r, i},
        r = Replace[Position[h, {_}], {a__} -> {a, -1}, 1];
        Sum[Insert[h, n, r[[i]]], {i, Length[r]}]
        ]
  marry[, n /; n < 3] := 0
  marry[h_, n_] := Module[{p, i},
        p = Position[h, _Integer];
        Sum[MapAt[{#, n} &, h, p[[i]]], {i, Length[p]}]
        ]
  extend[a_ + b_, n_] := extend[a, n] + extend[b, n]
  extend[a_, n_] := lead[a, n] + follow[a, n] + marry[a, n]
  hierarchies[1] := hierarchies[1] = extend[hier[{}], 1]
  hierarchies[n_] := hierarchies[n] = extend[hierarchies[n - 1], n] (* Daniel Geisler, Aug 22 2022 *)

a(n):=if n=1 then 1 else sum((n+k-1)!*sum(1/(k-j)!*sum((2^i*(-1)^(i)*stirling2(n+j-i-1,j-i))/((n+j-i-1)!*i!),i,0,j),j,1,k),k,1,n-1); /* Vladimir Kruchinin, Jan 28 2012 */

{a(n) = local(A); if( n<0, 0, for( i=1, n, A = Pol(exp(A + x * O(x^i)) - A + x - 1)); n! * polcoeff(A, n))}; /* Michael Somos, Jan 15 2004 */

{a(n) = my(A); if( n<0, 0, A = O(x); for( i=1, n, A = intformal( 1 / (1 + x - 2*A))); n! * polcoeff(A, n))}; /* Michael Somos, Oct 25 2014 */

{a(n) = n! * polcoeff(serreverse(1+2*x - exp(x +x^2*O(x^n))), n)}
for(n=0, 30, print1(a(n), ", ")) \\ Paul D. Hanna, Oct 27 2014

\p100 \\ set precision
{A=Vec(sum(n=0, 600, 1.*x/prod(k=0, n, 2 - k*x + O(x^31))))}
for(n=0, 25, print1(if(n<1,0,round(A[n])),", ")) \\ Paul D. Hanna, Oct 27 2014

from functools import lru_cache
from math import comb
@lru_cache(maxsize=None)
def A000311(n): return n if n <= 1 else -(n-1)*A000311(n-1)+comb(n,m:=n+1>>1)*(0 if n&1 else A000311(m)**2) + (sum(comb(n,i)*A000311(i)*A000311(n-i) for i in range(1,m))<<1) # Chai Wah Wu, Nov 10 2022

E.g.f. A(x) satisfies exp A(x) = 2*A(x) - x + 1.
a(0)=0, a(1)=a(2)=1; for n >= 2, a(n+1) = (n+2)*a(n) + 2*Sum_{k=2..n-1} binomial(n, k)*a(k)*a(n-k+1).
a(1)=1; for n>1, a(n) = -(n-1) * a(n-1) + Sum_{k=1..n-1} binomial(n, k) * a(k) * a(n-k). - Michael Somos, Jun 04 2012
From the umbral operator L in A135494 acting on x^n comes, umbrally, (a(.) + x)^n = (n * x^(n-1) / 2) - (x^n / 2) + Sum_{j>=1} j^(j-1) * (2^(-j) / j!) * exp(-j/2) * (x + j/2)^n giving a(n) = 2^(-n) * Sum_{j>=1} j^(n-1) * ((j/2) * exp(-1/2))^j / j! for n > 1. - Tom Copeland, Feb 11 2008
Let h(x) = 1/(2-exp(x)), an e.g.f. for A000670, then the n-th term of A000311 is given by ((h(x)*d/dx)^n)x evaluated at x=0, i.e., A(x) = exp(x*a(.)) = exp(x*h(u)*d/du) u evaluated at u=0. Also, dA(x)/dx = h(A(x)). - Tom Copeland, Sep 05 2011 (The autonomous differential eqn. here is also on p. 59 of Jones. - Tom Copeland, Dec 16 2019)
A134991 gives (b.+c.)^n = 0^n, for (b_n)=A000311(n+1) and (c_0)=1, (c_1)=-1, and (c_n)=-2* A000311(n) = -A006351(n) otherwise. E.g., umbrally, (b.+c.)^2 = b_2*c_0 + 2 b_1*c_1 + b_0*c_2 =0. - Tom Copeland, Oct 19 2011
a(n) = Sum_{k=1..n-1} (n+k-1)!*Sum_{j=1..k} (1/(k-j)!)*Sum_{i=0..j} 2^i*(-1)^i*Stirling2(n+j-i-1, j-i)/((n+j-i-1)!*i!), n>1, a(0)=0, a(1)=1. - Vladimir Kruchinin, Jan 28 2012
Using L. Comtet's identity and D. Wasserman's explicit formula for the associated Stirling numbers of second kind (A008299) one gets: a(n) = Sum_{m=1..n-1} Sum_{i=0..m} (-1)^i * binomial(n+m-1,i) * Sum_{j=0..m-i} (-1)^j * ((m-i-j)^(n+m-1-i))/(j! * (m-i-j)!). - Peter Regner, Oct 08 2012
G.f.: x/Q(0), where Q(k) = 1 - k*x - x*(k+1)/Q(k+1); (continued fraction). - Sergei N. Gladkovskii, May 01 2013
G.f.: x*Q(0), where Q(k) = 1 - x*(k+1)/(x*(k+1) - (1-k*x)*(1-x-k*x)/Q(k+1) ); (continued fraction). - Sergei N. Gladkovskii, Oct 11 2013
a(n) ~ n^(n-1) / (sqrt(2) * exp(n) * (2*log(2)-1)^(n-1/2)). - Vaclav Kotesovec, Jan 05 2014
E.g.f. A(x) satisfies d/dx A(x) = 1 / (1 + x - 2 * A(x)). - Michael Somos, Oct 25 2014
O.g.f.: Sum_{n>=0} x / Product_{k=0..n} (2 - k*x). - Paul D. Hanna, Oct 27 2014
E.g.f.: (x - 1 - 2 LambertW(-exp((x-1)/2) / 2)) / 2. - Vladimir Reshetnikov, Oct 16 2015 (This e.g.f. is given in A135494, the entry alluded to in my 2008 formula, and in A134991 along with its compositional inverse. - Tom Copeland, Jan 24 2018)
a(0) = 0, a(1) = 1; a(n) = n! * [x^n] exp(Sum_{k=1..n-1} a(k)*x^k/k!). - Ilya Gutkovskiy, Oct 17 2017
a(n+1) = Sum_{k=0..n} A269939(n, k) for n >= 1. - Peter Luschny, Feb 15 2021

Name edited by Gus Wiseman, Dec 28 2019

A000084 Number of series-parallel networks with n unlabeled edges. Also called yoke-chains by Cayley and MacMahon.

Original entry on oeis.org

1, 2, 4, 10, 24, 66, 180, 522, 1532, 4624, 14136, 43930, 137908, 437502, 1399068, 4507352, 14611576, 47633486, 156047204, 513477502, 1696305728, 5623993944, 18706733128, 62408176762, 208769240140, 700129713630, 2353386723912

Offset: 1

N. J. A. Sloane

This is a series-parallel network: o-o; all other series-parallel networks are obtained by connecting two series-parallel networks in series or in parallel.
Also the number of unlabeled cographs on n nodes. - N. J. A. Sloane and Eric W. Weisstein, Oct 21 2003
Also the number of P_4-free graphs on n nodes. - Gordon F. Royle, Jul 04 2008
Equals row sums of triangle A144962 and the INVERT transform of A001572. - Gary W. Adamson, Sep 27 2008
See Cameron (1987) p. 165 for a bijection between series-parallel networks and cographs. - Michael Somos, Apr 19 2014

			G.f. = x + 2*x^2 + 4*x^3 + 10*x^4 + 24*x^5 + 66*x^6 + 180*x^7 + 522*x^8 + ...
The series-parallel networks with 1, 2 and 3 edges are:
1 edge: o-o
2 edges: o-o-o o=o
....................... /\
3 edges: o-o-o-o o-o=o o--o o-o-o
....................... \/ ..\_/

D. E. Knuth, The Art of Computer Programming, 3rd ed. 1997, Vol. 1, p. 589, Answers to Exercises Section 2.3.4.4 5.
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 142.
J. Riordan and C. E. Shannon, The number of two-terminal series-parallel networks, J. Math. Phys., 21 (1942), 83-93. Reprinted in Claude Elwood Shannon: Collected Papers, edited by N. J. A. Sloane and A. D. Wyner, IEEE Press, NY, 1993, pp. 560-570.
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.40, notes on p. 133.

N. J. A. Sloane, Table of n, a(n) for n=1..1001
Moussa Abdenbi, Alexandre Blondin Massé, Alain Goupil, On the maximal number of leaves in induced subtrees of series-parallel graphs, Semantic Sensor Networks Workshop 2018, CEUR Workshop Proceedings (2018) Vol. 2113.
Antoni Amengual, The intriguing properties of the equivalent resistances of n equal resistors combined in series and in parallel, American Journal of Physics, 68(2), 175-179 (February 2000). - _Sameen Ahmed Khan_, Mar 06 2010
Taisir Avilés, Series-Parallel Resistors Catalogue
A. Brandstaedt, V. B. Le and J. P. Spinrad, Graph Classes: A Survey, SIAM Publications, 1999. (For definition of cograph)
Peter J. Cameron, Some treelike objects Quart. J. Math. Oxford Ser. (2) 38 (1987), no. 150, 155--183. MR0891613 (89a:05009). See p. 155. - _N. J. A. Sloane_, Apr 18 2014
P. J. Cameron, Some sequences of integers, Discrete Math., 75 (1989), 89-102; also in "Graph Theory and Combinatorics 1988", ed. B. Bollobas, Annals of Discrete Math., 43 (1989), 89-102.
P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.
Mehdi Nikopour Deilami and Bohdan Zhelyabovskyy, On the Average Resistance of n-circuits, arXiv:2410.07261 [math.CO], 2024. See p. 2.
S. R. Finch, Series-parallel networks, July 7, 2003. [Cached copy, with permission of the author]
Steven R. Finch, Mathematical Constants II, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, Cambridge, 2018.
O. Golinelli, Asymptotic behavior of two-terminal series-parallel networks, arXiv:cond-mat/9707023 [cond-mat.stat-mech], 1997.
S. Hougardy, Home Page
S. Hougardy, Classes of perfect graphs, Discr. Math. 306 (2006), 2529-2571.
ISCGI, Cograph graphs
Yukinao Isokawa, Series-Parallel Circuits and Continued Fractions, Applied Mathematical Sciences, Vol. 10, 2016, no. 27, 1321 - 1331.
Yukinao Isokawa, Listing up Combinations of Resistances, Bulletin of the Kagoshima University Faculty of Education. Bulletin of the Faculty of Education, Kagoshima University. Natural science, Vol. 67 (2016), pp. 1-8.
Sameen Ahmed Khan, Mathematica notebook for A048211 and A000084
Sameen Ahmed Khan, The bounds of the set of equivalent resistances of n equal resistors combined in series and in parallel, arXiv:1004.3346 [physics.gen-ph], 2010.
S. A. Khan, How Many Equivalent Resistances?, RESONANCE, May 2012.
S. A. Khan, Farey sequences and resistor networks, Proc. Indian Acad. Sci. (Math. Sci.) Vol. 122, No. 2, May 2012, pp. 153-162. - From _N. J. A. Sloane_, Oct 23 2012
Sameen Ahmed Khan, Beginning to count the number of equivalent resistances, Indian Journal of Science and Technology, 2016, Vol 9(44).
Z. A. Lomnicki, Two-terminal series-parallel networks, Adv. Appl. Prob., 4 (1972), 109-150.
P. A. MacMahon, Yoke-trains and multipartite compositions in connexion with the analytical forms called "trees", Proc. London Math. Soc. 22 (1891), 330-346; reprinted in Coll. Papers I, pp. 600-616. Page 333 gives A000084 = 2*A000669.
P. A. MacMahon, The combination of resistances, The Electrician, 28 (1892), 601-602; reprinted in Coll. Papers I, pp. 617-619. Reprinted in Discrete Appl. Math., 54 (1994), 225-228.
J. W. Moon, Some enumerative results on series-parallel networks, Annals Discrete Math., 33 (1987), 199-226.
David Richter, Generic Orthotopes, arXiv:2210.12012 [math.CO], 2022.
David Richter, Ehrhart Polynomials of Generic Orthotopes, arXiv:2309.09026 [math.CO], 2023.
J. Riordan and C. E. Shannon, The number of two-terminal series-parallel networks (annotated scanned copy)
N. J. A. Sloane, Illustrations of a(1)-a(4)
N. J. A. Sloane, First 1001 terms of A000669 and A000084
Marx Stampfli, Bridged graphs, circuits and Fibonacci numbers. Applied Mathematics and Computation. Volume 302, 1 June 2017, Pages 68-79.
Takeaki Uno, Ryuhei Uehara and Shin-ichi Nakano, Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression, in WALCOM: Algorithms and Computation, Lecture Notes in Computer Science, 2012, Volume 7157/2012, 5-16, DOI: 10.1007/978-3-642-28076-4_4. - _N. J. A. Sloane_, Jul 07 2012
Eric Weisstein's World of Mathematics, Cograph
Eric Weisstein's World of Mathematics, Series-Parallel Network

Cf. A058351, A058352, A058353, A000311, A006351 (labeled version).
See also A058964, A058965, A363065.
Cf. A144962, A001572. - Gary W. Adamson, Sep 27 2008
Cf. A176500, A176502. - Sameen Ahmed Khan, Apr 27 2010

# (continue from A000669):
A000084 := n-> if n=1 then 1 else 2*A000669(n); fi;
# N denotes all series-parallel networks, S = series networks, P = parallel networks; spec84 := [ N,{N=Union(Z,S,P),S=Set(Union(Z,P),card>=2),P=Set(Union(Z,S),card>=2)} ]: A000084 := n->combstruct[count](spec84,size=n);

n = 27; s = 1/(1-x) + O[x]^(n+1); Do[s = s/(1-x^k)^Coefficient[s, x^k] + O[x]^(n+1), {k, 2, n}]; CoefficientList[s, x] // Rest (* Jean-François Alcover, Jun 20 2011, updated Jun 30 2015 *)
(* faster method: *)
sequenceA000084[n_] := Module[{product, x}, product[1] = Series[1/(1 - x), {x, 0, n}]; product[k_] := product[k] = Series[product[k - 1]/(1 - x^k)^Coefficient[ product[k - 1], x^k], {x, 0, n}]; Quiet[Rest[CoefficientList[product[n], x]]]]; sequenceA000084[27] (* Faris Nasybulin, Apr 29 2015 *)
n = 27; Rest@
CoefficientList[ Fold[ #1/(1 - x^#2)^Coefficient[#1, x, #2] &, 1/(1 - x) + O[x]^(n + 1), Range[2, n]], x] (* Oliver Seipel, Sep 19 2021 *)

{a(n) = my(A); if( n<1, 0, A = 1 / (1 - x + x * O(x^n)); for(k=2, n, A /= (1 - x^k + x * O(x^n))^polcoeff(A, k)); polcoeff(A, n))}; /* Michael Somos, Oct 11 2006 */

The sequence satisfies Product_{k>=1} 1/(1-x^k)^A000669(k) = 1 + Sum_{k>=1} a(k)*x^k.
a(n) = 2*A000669(n) if n>0. - Michael Somos, Apr 17 2014
a(n) ~ C d^n/n^(3/2) where C = 0.412762889201578063700271574144..., d = 3.56083930953894332952612917270966777... is a root of Product_{n>=1} (1-1/x^n)^(-a(n)) = 2. - Riordan, Shannon, Moon, Rains, Sloane
Consider the free algebraic system with two commutative associative operators (x+y) and (x*y) and one generator A. The number of elements with n occurrences of the generator is a(n). - Michael Somos, Oct 11 2006 Examples: n=1: A. n=2: A+A, A*A. n=3: A+A+A, A+(A*A), A*(A+A), A*A*A.

More decimal places in the third formula added by Vaclav Kotesovec, Jun 24 2014

A032188 Number of labeled series-reduced mobiles (circular rooted trees) with n leaves (root has degree 0 or >= 2).

Original entry on oeis.org

1, 1, 5, 41, 469, 6889, 123605, 2620169, 64074901, 1775623081, 54989743445, 1882140936521, 70552399533589, 2874543652787689, 126484802362553045, 5977683917752887689, 301983995802099667861, 16239818347465293071401, 926248570498763547197525, 55847464116157184894240201

Offset: 1

Christian G. Bower

With offset 0, a(n) = number of partitions of the multiset {1,1,2,2,...,n,n} into lists of strictly decreasing lists, called blocks, such that the concatenation of all blocks in a list has the Stirling property: all entries between the two occurrences of i exceed i, 1<=i<=n. For example, with slashes separating blocks, a(2) = 5 counts 1/1/2/2; 1/2/2/1; 2/2/1/1; 1/2/2 1; 2/2 1/1, but not, for instance, 2 1/2/1 because it fails the Stirling test for i=2. - David Callan, Nov 21 2011

			D^3(1) = (24*x^2-64*x+41)/(2*x-1)^6. Evaluated at x = 0 this gives a(4) = 41.
a(3) = 5: Denote the colors of the vertices by the letters a,b,c, .... The 5 possible increasing plane trees on 3 vertices with vertices of outdegree k coming in 2^(k-1) colors are
.
   1a       1a        1b        1a        1b
   |       /  \      /  \      /  \      /  \
   2a     2    3    2    3    3    2    3    2
   |
   3

Andrew Howroyd, Table of n, a(n) for n = 1..200
François Bergeron, Philippe Flajolet, and Bruno Salvy, Varieties of Increasing Trees, Lecture Notes in Computer Science vol. 581, ed. J.-C. Raoult, Springer 1992, pp. 24-48.
Bishal Deb and Alan D. Sokal, Higher-order Stirling cycle and subset triangles: Total positivity, continued fractions and real-rootedness, arXiv:2507.18959 [math.CO], 2025. See pp. 6, 16, 30.
Diego Dominici, Nested derivatives: A simple method for computing series expansions of inverse functions arXiv:math/0501052 [math.CA], 2005.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 89
John Riordan, Letter to N. J. A. Sloane, Sep 26 1980 with notes on the 1973 Handbook of Integer Sequences. Note that the sequences are identified by their N-numbers, not their A-numbers.
Elena L. Wang and Guoce Xin, On Ward Numbers and Increasing Schröder Trees, arXiv:2507.15654 [math.CO], 2025. See p. 12.
Index entries for sequences related to mobiles

Cf. A006351, A032034.

Order := 20; t1 := solve(series((ln(1-A)+2*A),A)=x,A); A000311 := n->n!*coeff(t1,x,n);
# With offset 0:
a := n -> add(combinat:-eulerian2(n,k)*2^k,k=0..n):
seq(a(n),n=0..19); # Peter Luschny, Jul 09 2015

For[y=x+O[x]^21; oldy=0, y=!=oldy, oldy=y; y=((1-y)Log[1-y]+x*y+y-x)/(2y-1), Null]; Table[n!Coefficient[y, x, n], {n, 1, 20}]
Rest[CoefficientList[InverseSeries[Series[2*x + Log[1-x],{x,0,20}],x],x] * Range[0,20]!] (* Vaclav Kotesovec, Jan 08 2014 *)

a(n):=sum((n+k-1)!*sum(1/(k-j)!*sum((2^l*(-1)^(n+l+1)*stirling1(n-l+j-1,j-l))/(l!*(n-l+j-1)!),l,0,j),j,0,k),k,0,n-1); /* Vladimir Kruchinin, Feb 06 2012 */

N = 66; x = 'x + O('x^N);
Q(k) = if(k>N, 1,  1 + (k+1)*x - 2*x*(k+1)/Q(k+1) );
gf = 1/Q(0); Vec(gf) \\ Joerg Arndt, May 01 2013

{my(n=20); Vec(serlaplace(serreverse(2*x+log(1-x + O(x*x^n)))))} \\ Andrew Howroyd, Jan 16 2018

Doubles (index 2+) under "CIJ" (necklace, indistinct, labeled) transform.
E.g.f. A(x) satisfies log(1-A(x))+2*A(x)-x = 0. - Vladeta Jovovic, Dec 06 2002
With offset 0, second Eulerian transform of the powers of 2 [A000079]. See A001147 for definition of SET. - Ross La Haye, Feb 14 2005
From Peter Bala, Sep 05 2011: (Start)
The generating function A(x) satisfies the autonomous differential equation A'(x) = (1-A)/(1-2*A) with A(0) = 0. Hence the inverse function A^-1(x) = int {t = 0..x} (1-2*t)/(1-t) = 2*x+log(1-x). The expansion of A(x) can be found by inverting the above integral using the method of [Dominici, Theorem 4.1] to arrive at the result a(n) = D^(n-1)(1) evaluated at x = 0, where D denotes the operator g(x) -> d/dx((1-x)/(1-2*x)*g(x)). Compare with A006351.
Applying [Bergeron et al., Theorem 1] to the result x = int {t = 0..A(x)} 1/phi(t), where phi(t) = (1-t)/(1-2*t) = 1+t+2*t^2+4*t^3+8*t^4+... leads to the following combinatorial interpretation for this sequence: a(n) gives the number of plane increasing trees on n vertices where each vertex of outdegree k >= 1 can be colored in 2^(k-1) ways. An example is given below. (End)
The integral from 0 to infinity w.r.t. w of exp(-2w)(1-z*w)^(-1/z) gives an o.g.f. for the series with offset 0. Consequently, a(n)= sum(j=1 to infinity): St1d(n,j)/(2^(n+j-1)) where St1d(n,j) is the j-th element of the n-th diagonal of A132393 with offset=1; e.g., a(3)= 5 = 0/2^3 + 2/2^4 + 11/2^5 + 35/2^6 + 85/2^7 + ... . - Tom Copeland, Sep 15 2011
A signed o.g.f., with Γ(v,x) the incomplete gamma function (see A111999 with u=1), is g(z) = (2/z)^(-(1/z)-1) exp(2/z) Γ((1/z)+1,2/z)/z. - Tom Copeland, Sep 16 2011
With offset 0, a(n) = Sum[T(n+k,k), k=1..n] where T(n,k) are the associated Stirling numbers of the first kind (A008306). For example, a(3) = 41 = 6 + 20 + 15. - David Callan, Nov 21 2011
a(n) = sum(k=0..n-1, (n+k-1)!*sum(j=0..k, 1/(k-j)!*sum(l=0..j, (2^l*(-1)^(n+l+1)*stirling1(n-l+j-1,j-l))/(l!*(n-l+j-1)!)))), n>0. - Vladimir Kruchinin, Feb 06 2012
G.f.: 1/Q(0), where Q(k)= 1 + (k+1)*x - 2*x*(k+1)/Q(k+1); (continued fraction). - Sergei N. Gladkovskii, May 01 2013
a(n) ~ n^(n-1) / (2 * exp(n) * (1-log(2))^(n-1/2)). - Vaclav Kotesovec, Jan 08 2014
a(n) = A032034(n)/2. - Alois P. Heinz, Jul 04 2018
E.g.f: series reversion of 2*x + log(1-x). - Andrew Howroyd, Sep 19 2018

A112493 Triangle read by rows, T(n, k) = Sum_{j=0..n} C(n-j, n-k)*E2(n, j), where E2 are the second-order Eulerian numbers A201637, for n >= 0 and 0 <= k <= n.

Original entry on oeis.org

1, 1, 1, 1, 4, 3, 1, 11, 25, 15, 1, 26, 130, 210, 105, 1, 57, 546, 1750, 2205, 945, 1, 120, 2037, 11368, 26775, 27720, 10395, 1, 247, 7071, 63805, 247555, 460845, 405405, 135135, 1, 502, 23436, 325930, 1939630, 5735730, 8828820, 6756750, 2027025, 1

Offset: 0

Wolfdieter Lang, Oct 14 2005

Previous name was: Coefficient triangle of polynomials used for e.g.f.s of Stirling2 diagonals.
For the o.g.f. of diagonal k of the Stirling2 triangle one has a similar result. See A008517 (second-order Eulerian triangle).
A(m,x), the o.g.f. for column m, satisfies the recurrence A(m,x) = x*(x*(d/dx)A(m-1,x) + m*A(m-1,x))/(1-(m+1)*x), for m >= 1 and A(0,x) = 1/(1-x).
The e.g.f. for the sequence in column k+1, k >= 0, of A008278, i.e., for the diagonal k >= 0 of the Stirling2 triangle A048993, is exp(x)*Sum_{m=0..k} a(k,m)*(x^(m+k))/(m+k)!.
It appears that the triangles in this sequence and A124324 have identical columns, except for shifts. - Jörgen Backelin, Jun 20 2022
A refined version of this triangle is given in A356145, which contains a link providing the precise relationship between A124324 and this entry, confirming Jörgen Backelin's observation above. - Tom Copeland, Sep 24 2022

			Triangle starts:
  [1]
  [1, 1]
  [1, 4,  3]
  [1, 11, 25,  15]
  [1, 26, 130, 210,  105]
  [1, 57, 546, 1750, 2205, 945]
  ...
The e.g.f. of [0,0,1,7,25,65,...], the k=3 column of A008278, but with offset n=0, is exp(x)*(1*(x^2)/2! + 4*(x^3)/3! + 3*(x^4)/4!).
Third row [1,4,3]: There are three plane increasing trees on 3 vertices. The number of colors are shown to the right of a vertex.
...................................................
....1o.(1+t)...........1o.t*(1+t).....1o.t*(1+t)...
....|................. /.\............/.\..........
....|................ /...\........../...\.........
....2o.(1+t)........2o.....3o......3o....2o........
....|..............................................
....|..............................................
....3o.............................................
...................................................
The total number of trees is (1+t)^2 + t*(1+t) + t*(1+t) = 1+4*t+3*t^2 = R(2,t).

F. Bergeron, Ph. Flajolet and B. Salvy, Varieties of Increasing Trees, Lecture Notes in Computer Science vol. 581, ed. J.-C. Raoult, Springer 1992, pp. 24-48.
D. Dominici, Nested derivatives: A simple method for computing series expansions of inverse functions. arXiv:math/0501052v2 [math.CA], 2005.
Wolfdieter Lang, First ten rows.
MathOverflow, Recursion for row polynomials of A112493, (2025).
Andrew Elvey Price and Alan D. Sokal, Phylogenetic trees, augmented perfect matchings, and a Thron-type continued fraction (T-fraction) for the Ward polynomials, arXiv:2001.01468 [math.CO], 2020.

Row sums give A006351(k+1), k>=0.
The column sequences start with A000012 (powers of 1), A000295 (Eulerian numbers), A112495, A112496, A112497.
Cf. A008278, A008517, A048993, A054589, A075856, A134991, A201637, A124324.
Antidiagonal sums give A000110.
Cf. A356145.

T := (n, k) -> add(combinat:-eulerian2(n, j)*binomial(n-j, n-k), j=0..n):
seq(seq(T(n, k), k=0..n), n=0..9); # Peter Luschny, Apr 11 2016

max = 11; f[x_, t_] := -1 - (1 + t)/t*ProductLog[-t/(1 + t)*Exp[(x - t)/(1 + t)]]; coes = CoefficientList[ Series[f[x, t], {x, 0, max}, {t, 0, max}], {x, t}]* Range[0, max]!; Table[coes[[n, k]], {n, 0, max}, {k, 1, n - 1}] // Flatten (* Jean-François Alcover, Nov 22 2012, from e.g.f. *)

a(k, m) = 0 if k < m, a(k, -1):=0, a(0, 0)=1, a(k, m)=(m+1)*a(k-1, m) + (k+m-1)*a(k-1, m-1) else.
From Peter Bala, Sep 30 2011: (Start)
E.g.f.: A(x,t) = -1-((1+t)/t)*LambertW(-(t/(1+t))*exp((x-t)/(1+t))) = x + (1+t)*x^2/2! + (1+4*t+3*t^2)*x^3/3! + .... A(x,t) is the inverse function of (1+t)*log(1+x)-t*x.
A(x,t) satisfies the partial differential equation (1-x*t)*dA/dx = 1 + A + t*(1+t)*dA/dt. It follows that the row generating polynomials R(n,t) satisfy the recurrence R(n+1,t) =(n*t+1)*R(n,t) + t*(1+t)*dR(n,t)/dt. Cf. A054589 and A075856. The polynomials t/(1+t)*R(n,t) are the row polynomials of A134991.
The generating function A(x,t) satisfies the autonomous differential equation dA/dx = (1+A)/(1-t*A). Applying [Bergeron et al., Theorem 1] gives a combinatorial interpretation for the row generating polynomials R(n,t): R(n,t) counts plane increasing trees on n+1 vertices where the non-leaf vertices of outdegree k come in t^(k-1)*(1+t) colors. An example is given below. Cf. A006351, which corresponds to the case t = 1. Applying [Dominici, Theorem 4.1] gives the following method for calculating the row polynomials R(n,t): Let f(x) = (1+x)/(1-x*t). Then R(n,t) = (f(x)*d/dx)^n(f(x)) evaluated at x = 0. (End)
Sum_{j=0..n} T(n-j,j) = A000110(n). - Alois P. Heinz, Jun 20 2022
From Mikhail Kurkov, Apr 01 2025: (Start)
E.g.f.: B(y) = -w/(x*(1+w)) where w = LambertW(-x/(1+x)*exp((y-x)/(1+x))) satisfies the first-order ordinary differential equation (1+x)*B'(y) = B(y)*(1+x*B(y))^2, hence row polynomials are P(n,x) = P(n-1,x) + x*Sum_{j=0..n-1} binomial(n, j)*P(j,x)*P(n-j-1,x) for n > 0 with P(0,x) = 1 (see MathOverflow link).
Conjecture: row polynomials are P(n,x) = Sum_{i=0..n} Sum_{j=0..i} Sum_{k=0..j} (n+i)!*Stirling1(n+j-k,j-k)*x^k*(x+1)^(j-k)*(-1)^(j+k)/((n+j-k)!*(i-j)!*k!). (End)
Conjecture: g.f. satisfies 1/(1 - x - x*y/(1 - 2*x - 2*x*y/(1 - 3*x - 3*x*y/(1 - 4*x - 4*x*y/(1 - 5*x - 5*x*y/(1 - ...)))))) (see A383019 for conjectures about combinatorial interpretation and algorithm for efficient computing). - Mikhail Kurkov, Apr 21 2025

New name from Peter Luschny, Apr 11 2016

A274804 The exponential transform of sigma(n).

Original entry on oeis.org

1, 1, 4, 14, 69, 367, 2284, 15430, 115146, 924555, 7991892, 73547322, 718621516, 7410375897, 80405501540, 914492881330, 10873902417225, 134808633318271, 1738734267608613, 23282225008741565, 323082222240744379, 4638440974576329923, 68794595993688306903

Offset: 0

Johannes W. Meijer, Jul 27 2016

nonn

The exponential transform [EXP] transforms an input sequence b(n) into the output sequence a(n). The EXP transform is the inverse of the logarithmic transform [LOG], see the Weisstein link and the Sloane and Plouffe reference. This relation goes by the name of Riddell's formula. For information about the logarithmic transform see A274805. The EXP transform is related to the multinomial transform, see A274760 and the second formula.
The definition of the EXP transform, see the second formula, shows that n >= 1. To preserve the identity LOG[EXP[b(n)]] = b(n) for n >= 0 for a sequence b(n) with offset 0 the shifted sequence b(n-1) with offset 1 has to be used as input for the exponential transform, otherwise information about b(0) will be lost in transformation.
In the a(n) formulas, see the examples, the multinomial coefficients A178867 appear.
We observe that a(0) = 1 and provides no information about any value of b(n), this notwithstanding it is customary to start the a(n) sequence with a(0) = 1.
The Maple programs can be used to generate the exponential transform of a sequence. The first program uses a formula found by Alois P. Heinz, see A007446 and the first formula. The second program uses the definition of the exponential transform, see the Weisstein link and the second formula. The third program uses information about the inverse of the exponential transform, see A274805.
Some EXP transform pairs are, n >= 1: A000435(n) and A065440(n-1); 1/A000027(n) and A177208(n-1)/A177209(n-1); A000670(n) and A075729(n-1); A000670(n-1) and A014304(n-1); A000045(n) and A256180(n-1); A000290(n) and A033462(n-1); A006125(n) and A197505(n-1); A053549(n) and A198046(n-1); A000311(n) and A006351(n); A030019(n) and A134954(n-1); A038048(n) and A053529(n-1); A193356(n) and A003727(n-1).

			Some a(n) formulas, see A178867:
a(0) = 1
a(1) = x(1)
a(2) = x(1)^2 + x(2)
a(3) = x(1)^3 + 3*x(1)*x(2) + x(3)
a(4) = x(1)^4 + 6*x(1)^2*x(2) + 4*x(1)*x(3) + 3*x(2)^2 + x(4)
a(5) = x(1)^5 + 10*x(1)^3*x(2) + 10*x(1)^2*x(3) + 15*x(1)*x(2)^2 + 5*x(1)*x(4) + 10*x(2)*x(3) + x(5)

Frank Harary and Edgar M. Palmer, Graphical Enumeration, 1973.
Robert James Riddell, Contributions to the theory of condensation, Dissertation, University of Michigan, Ann Arbor, 1951.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 1995, pp. 18-23.

Alois P. Heinz, Table of n, a(n) for n = 0..531
M. Bernstein and N. J. A. Sloane, Some Canonical Sequences of Integers, Linear Algebra and its Applications, Vol. 226-228 (1995), pp. 57-72. Erratum 320 (2000), 210. [Link to arXiv version]
M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to Lin. Alg. Applic. version together with omitted figures]
N. J. A. Sloane, Transforms.
Eric W. Weisstein MathWorld, Exponential Transform.

Cf. A274805, A274760, A178867, A000203, A007446.
Cf. A177208, A177209, A006351, A197505, A144180, A256180, A033462, A198046, A134954, A145460, A188489, A005432, A029725, A124213, A002801.
Cf. A036040, another version.

nmax:=21: with(numtheory): b := proc(n): sigma(n) end: a:= proc(n) option remember; if n=0 then 1 else add(binomial(n-1, j-1) * b(j) *a(n-j), j=1..n) fi: end: seq(a(n), n=0..nmax); # End first EXP program.
nmax:= 21: with(numtheory): b := proc(n): sigma(n) end: t1 := exp(add(b(n)*x^n/n!, n=1..nmax+1)): t2 := series(t1, x, nmax+1): a := proc(n): n!*coeff(t2, x, n) end: seq(a(n), n=0..nmax); # End second EXP program.
nmax:=21: with(numtheory): b := proc(n): sigma(n) end: f := series(log(1+add(q(n)*x^n/n!, n=1..nmax+1)), x, nmax+1): d := proc(n): n!*coeff(f, x, n) end: a(0):=1: q(0):=1: a(1):=b(1): q(1):=b(1): for n from 2 to nmax+1 do q(n) := solve(d(n)-b(n), q(n)): a(n):=q(n): od: seq(a(n), n=0..nmax); # End third EXP program.

a[0] = 1; a[n_] := a[n] = Sum[Binomial[n-1, j-1]*DivisorSigma[1, j]*a[n-j], {j, 1, n}]; Table[a[n], {n, 0, 30}] (* Jean-François Alcover, Feb 22 2017 *)
nmax = 20; CoefficientList[Series[Exp[Sum[DivisorSigma[1, k]*x^k/k!, {k, 1, nmax}]], {x, 0, nmax}], x] * Range[0, nmax]! (* Vaclav Kotesovec, Jun 08 2021 *)

a(n) = Sum_{j=1..n} (binomial(n-1,j-1) * b(j) * a(n-j)), n >= 1 and a(0) = 1, with b(n) = A000203(n) = sigma(n).

E.g.f.: exp(Sum_{n >= 1} b(n)*x^n/n!) with b(n) = sigma(n) = A000203(n).

A005640 Number of phylogenetic trees with n labels.

Original entry on oeis.org

1, 1, 2, 8, 64, 832, 15104, 352256, 10037248, 337936384, 13126565888, 577818263552, 28425821618176, 1545553369366528, 92034646352592896, 5956917762776367104, 416397789920380321792, 31262503202358260924416, 2508985620606225641111552, 214348807882902869374926848, 19422044917978876510600167424

Offset: 0

N. J. A. Sloane

Each node of the tree is a subset of the labeled set {1,...,n}. If the subset node is empty, it must have degree at least 3.

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.26.

Vincenzo Librandi, Table of n, a(n) for n = 0..100
L. R. Foulds and R. W. Robinson, Determining the asymptotic number of phylogenetic trees, pp. 110-126 of Combinatorial Mathematics VII (Newcastle, August 1979), ed. R. W. Robinson, G. W. Southern and W. D. Wallis. Lecture Notes in Math., 829 (1980), 110-126. (Annotated scanned copy)
J. P. Hayes, Enumeration of fanout-free Boolean functions, J. ACM, 23 (1976), 700-709.
K. L. Kodandapani and S. C. Seth, On combinational networks with restricted fan-out, IEEE Trans. Computers, 27 (1978), 309-318. (Annotated scanned copy)
N. J. A. Sloane, Transforms
Index entries for sequences related to trees

Cf. A000311, A005172, A005263, A006351.

a[n_ /; n > 2] := 2^(n-1)*(n-2)!*Sum[ Binomial[n+k-2, n-2]*Sum[ (-1)^j*Binomial[k, j]*Sum[ ((-1)^l*2^(j-l)*Binomial[j, l]*(j-l)!*StirlingS1[n+j-l-2, j-l])/(n+j-l-2)!, {l, 0, j}], {j, 1, k}], {k, 1, n-2}]; a[0] = a[1] = 1; a[2] = 2; Table[a[n], {n, 0, 17}] (* Jean-François Alcover, Apr 10 2012, after Vladimir Kruchinin *)

STIRLING transform of A005263.
E.g.f.: 1+B(x)-B(x)^2 where B(x) is e.g.f. of A005172.
For n >= 2, a(n) = 2^n*A006351(n) = 2^(n+1)*A000311(n).

More terms, formula and comment from Christian G. Bower, Nov 15 1999

A058381 Number of series-parallel networks with n labeled edges, multiple edges not allowed.

Original entry on oeis.org

0, 1, 1, 4, 20, 156, 1472, 17396, 239612, 3827816, 69071272, 1394315088, 31081310944, 758901184432, 20135117147056, 576927779925568, 17752780676186432, 583910574851160000, 20443098012485430272, 759064322969950283072, 29793617955495321025472

Offset: 0

N. J. A. Sloane, Dec 19 2000

Steven R. Finch, Series-parallel networks
Steven R. Finch, Series-parallel networks, July 7, 2003. [Cached copy, with permission of the author]
J. W. Moon, Some enumerative results on series-parallel networks, Annals Discrete Math., 33 (1987), 199-226 (the sequence V_n).
Index entries for sequences mentioned in Moon (1987)

Equals A058379 + A058380.

Cf. A006351.

max=19; f[x_] := -2*ProductLog[-Sqrt[1+x]/(2*Sqrt[E])]-1;
CoefficientList[Series[f[x], {x, 0, max}], x]*Range[0, max]! (* Jean-François Alcover, May 21 2012, after Vladeta Jovovic *)

a(n):=sum((sum((m+k-1)!*sum(((-1)^j*sum((2^(j-l)*(-1)^l *stirling1(m-l+j-1,j-l))/(l!*(m-l+j-1)!),l,0,j))/(k-j)!,j,0,k),k,0,m-1)) *stirling1(n,m),m,1,n); /* Vladimir Kruchinin, Feb 17 2012 */

E.g.f.: -2*LambertW(-1/2*exp(-1/2)*(1+x)^(1/2))-1. - Vladeta Jovovic, Aug 21 2006
a(n) = Sum(m=1..n, (Sum(k=0..m-1, (m+k-1)!*Sum(j=0..k, ((-1)^j *Sum(L=0..j, (2^(j-l)*(-1)^L*Stirling1(m-L+j-1,j-L))/(l!*(m-L+j-1)!)))/(k-j)!)))*Stirling1(n,m)). - Vladimir Kruchinin, Feb 17 2012
a(n) ~ n^(n-1) / (sqrt(2) * (4-exp(1))^(n-1/2)). - Vaclav Kotesovec, Jul 09 2013
a(n) = Sum_{k=1..n} Stirling1(n, k) * A006351(k), n > 0. - Sean A. Irvine, Feb 03 2018

A140945 Triangle read by rows: counts series-parallel networks by the number of series connections.

Original entry on oeis.org

1, 1, 1, 1, 6, 1, 1, 25, 25, 1, 1, 90, 290, 90, 1, 1, 301, 2450, 2450, 301, 1, 1, 966, 17451, 41580, 17451, 966, 1, 1, 3025, 112035, 544971, 544971, 112035, 3025, 1, 1, 9330, 671980, 6076350, 12122502, 6076350, 671980, 9330, 1, 1, 28501, 3846700, 60738700, 217523922, 217523922, 60738700, 3846700, 28501, 1

Offset: 1

Brian Drake, Jul 24 2008

T(n,k) is the number of series-parallel matroids on [n+1] of rank k. - Andrew Howroyd, Mar 08 2023

			Triangle begins:
  1;
  1,   1;
  1,   6,     1;
  1,  25,    25,     1;
  1,  90,   290,    90,     1;
  1, 301,  2450,  2450,   301,   1;
  1, 966, 17451, 41580, 17451, 966, 1;
  ...

Andrew Howroyd, Table of n, a(n) for n = 1..1275 (rows 1..50; first 17 rows from Brian Drake, Jul 24 2008)
Brian Drake, An inversion theorem for labeled trees and some limits of areas under lattice paths (Example 1.5.1), A dissertation presented to the Faculty of the Graduate School of Arts and Sciences of Brandeis University.
Luis Ferroni and Matt Larson, Kazhdan-Lusztig polynomials of braid matroids, arXiv:2303.02253 [math.CO], 2023.
Nicholas Proudfoot, Yuan Xu, and Ben Young, On the enumeration of series-parallel matroids, arXiv:2406.04502 [math.CO], 2024.

Row sums are A006351.
Second column is A000392.
Cf. A359985.

N:=6: 1/a*log(1+a*y)+1*log(1+b*y)/b-y=x: solve(%, y):series(%, x, N): simplify(%, symbolic): convert(%, polynom): subs(b=1, %): R:= [seq(i!*coeff(%, x, i), i=1..N-1)]: seq( seq(coeff(R[i], a, j), j=0..i-1), i=1..N-1);

T(n) = {[Vecrev(p) | p<-Vec(serlaplace(intformal(serreverse(log(1 + x*y + O(x*x^n))/y + log(1 + x + O(x*x^n)) - x))))]}
{ my(A=T(10)); for(i=1, #A, print(A[i])) }  \\ Andrew Howroyd, Mar 08 2023

E.g.f. is reversion of log(1+ax)/a+log(1+bx)/b-x.

Let f(x,t) = (1+x)*(1+x*t)/(1-x^2*t) and let D be the operator f(x,t)*d/dx. Then the n-th row polynomial equals (D^n)(f(x,t)) evaluated at x = 0. - Peter Bala, Sep 29 2011

A356145 Coefficients of the inverse refined Eulerian partition polynomials [E]^{-1}, partitional inverse to A145271. Irregular triangle read by row with lengths A000041.

Original entry on oeis.org

1, 1, -1, 1, 3, -4, 1, -15, 25, -4, -7, 1, 105, -210, 70, 60, -15, -11, 1, -945, 2205, -1120, -630, 70, 350, 126, -15, -26, -16, 1, 10395, -27720, 18900, 7875, -2800, -6930, -1638, 560, 455, 784, 238, -56, -42, -22, 1, -135135, 405405, -346500, -114345, 84700

Offset: 0

Tom Copeland, Jul 27 2022

These are the coefficients of the inverse refined Eulerian partitions polynomials, the substitutional inverse to the refined Eulerian partition polynomials [E] of A145271. [E] and [E]^{-1} are a conjugate dual with respect to the permutahedra polynomials [P] of A133314 (see formula section).

			The first few rows of coefficients with monomials in reverse order to the partitions of Abramowitz and Stegun (link in A000041, pp. 831-2) are
0)       1;
1)       1;
2)      -1,      1;
3)       3,     -4,       1;
4)     -15,     25,      -4,      -7,     1;
5)     105,   -210,      70,      60,   -15,    -11,     1;
6)    -945,   2205,   -1120,    -630,    70,    350,   126,   -15,    -26,    -16,      1;
7)   10395, -27720,   18900,    7875, -2800,  -6930, -1638,   560,    455,    784,    238,   -56,  -42,  -22,    1;
8) -135135, 405405, -346500, -114345, 84700, 138600, 24255, -2800, -27300, -11025, -18900, -3780, 1575, 1344, 2142, 1596, 414, -56, -98, -64, -29, 1;
    ...
The first few partition polynomials are
E_0^{(-1)} = 1,
E_1^{(-1)} = a1,
E_2^{(-1)} = -a1^2 + a2,
E_3^{(-1)} = 3 a1^3 - 4 a1 a2 + a3,
E_4^{(-1)} = -15 a1^4 + 25 a1^2 a2 - 4 a2^2 - 7 a1 a3 + a4,
E_5^{(-1)} = 105 a1^5 - 210 a1^3 a2 + 70 a1 a2^2 + 60 a1^2 a3 - 15 a2 a3 - 11 a1 a4 + a5,
E_6^{(-1)} = -945 a1^6 + 2205 a1^4 a2 - 1120 a1^2 a2^2 - 630 a1^3 a3 + 70 a2^3 + 350 a1 a2 a3 + 126 a1^2 a4 - 15 a3^2 - 26 a2 a4 - 16 a1 a5 + a6,
E_7^{(-1)} = 10395 a1^7 - 27720 a1^5 a2 + 18900 a1^3 a2^2 + 7875 a1^4 a3 - 2800 a1 a2^3 - 6930 a1^2 a2 a3 - 1638 a1^3 a4 + 560 a2^2 a3 + 455 a1 a3^2 + 784 a1 a2 a4 + 238 a1^2 a5 - 56 a3 a4 - 42 a2 a5 - 22 a1 a6 + a7,
E_8^{(-1)} = -135135 a1^8 + 405405 a1^6 a2 - 346500 a1^4 a2^2 - 114345 a1^5 a3 + 84700 a1^2 a2^3 + 138600 a1^3 a2 a3 + 24255 a1^4 a4 - 2800 a2^4 - 27300 a1 a2^2 a3 - 11025 a1^2 a3^2 - 18900 a1^2 a2 a4 - 3780 a1^3 a5 + 1575 a2 a3^2 + 1344 a2^2 a4 + 2142 a1 a3 a4 + 1596 a1 a2 a5 + 414 a1^2 a6 - 56 a4^2 - 98 a3 a5 - 64 a2 a6 - 29 a1ma7 + a8,
... .
Example substitution identities:
With the permutahedra polynomials
P_1 = -a_1,
P_2 = 2*a_1^2 - a_2,
P_3 = -6*a_1^3 + 6*a_2*a_1 - a_3,
the refined Eulerian polynomials
E_1 = a_1,
E_2 = a_1^2 + a_2,
E_3 = a_1^3 + 4*a_1*a_2 + a_3,
the reciprocal tangent polynomials
RT_1 = -a_1,
RT_2 = -a_2 + a_1^2,
RT_3 = -a_3 + 2*a_1*a_2 - a_1^3,
the Lagrange inversion polynomials
L_1 = -a_1,
L_2 = 3*a_1^2 - a_2,
L_3 = -15*a_1^3 + 10*a_1a_2 - a_3,
then
E^{-1}_3 = P_3(L_1,L_2,L_3) = -6*(-a_1)^3 + 6*(3*a_1^2 - a_2)*(-a_1) - (-15*a_1^3 + 10*a_1*a_2 - a_3) = 3*a_1^3 - 4*a_2*a_1 + a_3,
E^{-1}_3 = RT_3(P_1,P_2,P_3) = -(-6*a_1^3 + 6*a_2*a_1 - a_3) + 2*(-a_1)*(2*a_1^2 - a_2) - (-a_1)^3 = 3*a_1^3 - 4*a_2*a_1 + a_3,
E{-1}_3(E_1,E_2,E_3) = 3*a_1^3 - 4*a_1*(a_1^2 + a_2) + (a_1^3 + 4*a_1*a_2 + a_3) = a_3.

Tom Copeland, Matryoshka Dolls: Iterated noncrossing partitions, the refined Narayana group, and quantum fields, 2022.
Tom Copeland, One Matrix to Rule Them All, 2022.
Tom Copeland, The reduced inverse refined Eulerian polynomials and associated arrays, 2022.

Cf. A000041, A006351, A112493, A124324, A133314, A134685, A134991, A145271, A356144.

rows[nn_] := {{1}}~Join~With[{s = 1/D[InverseSeries[x + Sum[c[k - 1] x^k/k!, {k, 2, nn}] + O[x]^(nn + 1)], x]}, Table[Coefficient[n! s, x^n Product[c[t], {t, p}]], {n, nn-1}, {p, Reverse[Sort[Sort /@ IntegerPartitions[n]]]}]];
rows[8] // Flatten (* Andrey Zabolotskiy, Feb 17 2024 *)

B. = PolynomialRing(ZZ)
A. = PowerSeriesRing(B)
f =  x + a1*x^2/factorial(2) + a2*x^3/factorial(3) + a3*x^4/factorial(4) + a4*x^5/factorial(5) + a5*x^6/factorial(6) + a6*x^7/factorial(7) + a7*x^8/factorial(8) + a8*x^9/factorial(9) + a9*x^10/factorial(10)
g = f.reverse()
w = derivative(g,x)
I = 1 / w
# Added by Peter Luschny, Feb 17 2024:
for n, c in enumerate(I.list()[:9]):
    print(f"E[{n}]", (factorial(n)*c).coefficients())

Given the formal Taylor series or e.g.f. f(x) = x + a_1 x^2/2! + a_2 x^3/3! + ...,
E_n^{-1}(a_1,a_2,...,a_n) = D_{x=0}^n 1 / (D_x f^{(-1)}(x)), where D_x is the derivative w.r.t. x and f^{(-1)}(x) is the (possibly formal) compositional inverse of f(x) about the origin.
E_n^{-1}(a_1,a_2,...,a_n) = D_{x=0}^n 1 f'(f^{(-1)}(x)) by the inverse function theorem, where the prime indicates differentiation w.r.t. the argument of the function f. Note the correspondence to the analytic definitions of the reciprocal tangents [RT] of A356144, consistent with the following algebraic identities.
[E]^{-1} = [P][L] = [P][E][P] = [RT][P], representing, e.g., the substitution of the permutahedra polynomials [P] of A133314 for the indeterminates of the reciprocal tangent polynomials [RT] of A356144. [E] are the refined Eulerian polynomials of A145271, and [L], the classic Lagrange inversion polynomials of A134685.
Since [P]^2 = [L]^2 = [RT]^2 = [I], the substitutional identity, i.e., [P], [L], and [RT] are involutive transformations, many identities follow from the basic ones above, e.g., [L] = [P][E]^{-1} gives an inversion formula for a formal e.g.f. f(x) = x + a_1 x^2/2! + a_2 x^3/3! + ..., and we can identify [E] and [E]^{-1} as a conjugate dual.
With a_n = -x, [E]^{-1} reduces to a signed version of A112493 with an additional initial row, with the row sums of the unsigned coefficients being (1, A006351). A112493 is also given by the diagonals of A124324. See my link above on the reduced polynomials and associated arrays for more detail.
The sequence of row sums of the signed coefficients, i.e., E^{-1}(1,1,...,1), is the sequence (1, 1, 0, 0, 0, 0, ...).
Conjecture: row polynomials are R(n,1) for n > 0 where R(n,k) = R(n-1,k+1) - Sum_{j=1..n-1} binomial(n-1,j-1)*R(j,k)*R(n-j,1) for n > 1, k > 0 with R(1,k) = a_k for k > 0. - Mikhail Kurkov, Mar 22 2025

cp's OEIS Frontend

A217061 Expansion of e.g.f. exp(A006351(x)).

Views

Author

Keywords

Crossrefs

Programs

Mathematica

Maxima

PARI

Formula

Extensions

A000311 Schroeder's fourth problem; also series-reduced rooted trees with n labeled leaves; also number of total partitions of n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

Maxima

PARI

PARI

PARI

PARI

Python

Formula

Extensions

A000084 Number of series-parallel networks with n unlabeled edges. Also called yoke-chains by Cayley and MacMahon.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A032188 Number of labeled series-reduced mobiles (circular rooted trees) with n leaves (root has degree 0 or >= 2).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Maxima

PARI

PARI

Formula

A112493 Triangle read by rows, T(n, k) = Sum_{j=0..n} C(n-j, n-k)*E2(n, j), where E2 are the second-order Eulerian numbers A201637, for n >= 0 and 0 <= k <= n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A274804 The exponential transform of sigma(n).

Views

Author

Keywords

Comments