cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

User: Stephan Wagner

Stephan Wagner's wiki page.

Stephan Wagner has authored 3 sequences.

A301871 Number of N- and bowtie-free posets with n elements.

Original entry on oeis.org

1, 2, 5, 14, 40, 121, 373, 1184, 3823, 12554, 41733, 140301, 475934, 1627440, 5602983, 19406703, 67574371, 236409625, 830582851, 2929246932, 10366380583, 36801225872, 131021870786, 467701875135, 1673584553886, 6002046468815, 21570135722058, 77668429499325, 280167079428684, 1012323004985313
Offset: 1

Author

Stephan Wagner, Mar 28 2018

Keywords

Comments

The number of n-element posets that do not include the two 4-element posets "N" and "bowtie" as induced subposets.

Crossrefs

Cf. A000112, A003430, A079144, A079146 for related sequences regarding the enumeration of unlabeled posets.

Programs

  • Mathematica
    V=1;Do[V = Normal[Series[(1 - x) Exp[Sum[(2 x^m - x^(2 m)) (V /. x -> x^m)/m, {m, 1, n}]], {x, 0, n}]], {n, 1, 20}]; Table[Coefficient[V,x,n],{n, 1, 20}]

Formula

G.f. V(x) = 1 + x + 2x + 5x^2 + ... satisfies V(x) = (1-x)exp[sum_{m >=1} (2x^m-x^(2m))V(x^m)/m] (see Razanajatovo Misanantenaina/Wagner).

A281578 Maximum number of nonisomorphic root-containing subtrees of a rooted tree of order n.

Original entry on oeis.org

1, 2, 3, 5, 7, 11, 16, 24, 34, 54, 79, 119, 169, 269, 394, 594, 850
Offset: 1

Author

Stephan Wagner, Jan 24 2017

Keywords

Comments

Isomorphism is understood in the rooted sense: isomorphisms have to preserve the root.

Examples

			For n=4, the unique rooted tree with two branches of order 1 and 2 respectively has a(4)=5 nonisomorphic subtrees containing the root: one each of order 1,2,4, and two of order 3. The three other rooted trees of order 4 have only four nonisomorphic subtrees.
		

Crossrefs

Cf. A281094.

Extensions

a(16)-a(17) from Manfred Scheucher, Mar 11 2018

A281094 Maximum number of nonisomorphic subtrees of a tree of order n.

Original entry on oeis.org

1, 2, 3, 4, 6, 8, 11, 16, 23, 33, 47, 68, 105, 160, 245, 366, 545, 816, 1212
Offset: 1

Author

Stephan Wagner, Jan 24 2017

Keywords

Examples

			For n=5, the path and the star both have five nonisomorphic subtrees (paths resp. stars of all orders from 1 to 5). The third possible tree of order 5 has six nonisomorphic subtrees (one each of order 1,2,3,5 and two of order 4: the star and the path). Hence a(5)=6.
		

Crossrefs

Cf. A281578.

Extensions

a(16)-a(19) from Manfred Scheucher, Mar 10 2018