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!)
A322754 Number of unlabeled 7-trees on n nodes 0
0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 5, 15, 64, 342, 2344, 19137, 181098, 1922215, 22472875, 284556458, 3849828695, 54974808527, 819865209740, 12655913153775, 200748351368185, 3253193955012557, 53619437319817482, 895778170144927928, 15129118461773051724 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,10

COMMENTS

A k-tree is recursively defined as follows: K_k is a k-tree and any k-tree on n+1 vertices is obtained by joining a vertex to a k-clique in a k-tree on n vertices.

REFERENCES

Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, page 328.

LINKS

Table of n, a(n) for n=1..29.

Andrew Gainer-Dewar, Gamma-Species and the Enumeration of k-Trees, Electronic Journal of Combinatorics, Volume 19 (2012), #P45.

CROSSREFS

Cf. A054581 (unlabeled 2-trees), A078792 (unlabeled 3-trees), A078793 (unlabeled 4-trees), A201702 (unlabeled 5-trees), A202037 (unlabeled 6-trees).

Sequence in context: A078793 A201702 A202037 * A224917 A274100 A166355

Adjacent sequences:  A322751 A322752 A322753 * A322755 A322756 A322757

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Dec 26 2018

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 September 29 17:34 EDT 2022. Contains 357090 sequences. (Running on oeis4.)