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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007453 Number of unlabeled connected series-parallel posets with n nodes.
(Formerly M2813)
10
1, 1, 3, 9, 30, 103, 375, 1400, 5380, 21073, 83950, 338878, 1383576, 5702485, 23696081, 99163323, 417553252, 1767827220, 7520966100, 32135955585, 137849390424, 593407692685, 2562695780058, 11099806544050, 48206136562750, 209876865026303, 915840095739301 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..1000 (first 100 terms from Jean-François Alcover)
B. I. Bayoumi, M. H. El-Zahar and S. M. Khamis, Asymptotic enumeration of N-free partial orders, Order 6 (1989), 219-232.
P. J. Cameron, On the probability of connectedness, Discrete Math., 167 (1997), 175-187.
P. J. Cameron, Some sequences of integers, Discrete Math., 75 (1989), 89-102.
P. J. Cameron, Some sequences of integers, in "Graph Theory and Combinatorics 1988", ed. B. Bollobas, Annals of Discrete Math., 43 (1989), 89-102.
Soheir M. Khamis, Height counting of unlabeled interval and N-free posets, Discrete Math. 275 (2004), no. 1-3, 165-175.
FORMULA
See the 1989 and 1997 papers by Cameron cited above for generating functions, and the 1997 paper for asymptotics.
Inverse Euler transform of A003430. - Sean A. Irvine, Jan 04 2018
a(n) = A003430(n) - A007454(n) for n > 1. - Sean A. Irvine, Jan 04 2018
MATHEMATICA
terms = 25; A[_] = 1;
Do[A[x_] = Exp[Sum[(1/k)*(A[x^k] + 1/A[x^k] - 2 + x^k), {k, 1, terms+1}]] + O[x]^(terms+1) // Normal, terms+1];
A003430 = CoefficientList[A[x], x] // Rest;
mob[m_, n_] := If[Mod[m, n] == 0, MoebiusMu[m/n], 0];
EULERi[b_] := Module[{a, c, i, d}, c = {}; For[i = 1, i <= Length[b], i++, c = Append[c, i*b[[i]] - Sum[c[[d]]*b[[i - d]], {d, 1, i-1}]]]; a = {}; For[i = 1, i <= Length[b], i++, a = Append[a, (1/i)*Sum[mob[i, d]*c[[d]], {d, 1, i}]]]; Return[a]];
EULERi[A003430] (* Jean-François Alcover, Jan 23 2020 *)
CROSSREFS
Sequence in context: A228248 A047064 A047007 * A148952 A148953 A148954
KEYWORD
nonn,nice
AUTHOR
EXTENSIONS
Name corrected by Salah Uddin Mohammad, Jun 07 2020
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 13:07 EDT 2024. Contains 371945 sequences. (Running on oeis4.)