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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A202037 Number of unlabeled 6-trees on n nodes 2
 0, 0, 0, 0, 0, 1, 1, 1, 2, 5, 15, 64, 342, 2344, 19090, 179562, 1878277, 21365403, 258965451, 3294561195, 43472906719, 589744428065, 8171396893523, 115094557122380, 1642269376265063, 23679803216530017, 344396036645439675, 5045351124912000756 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,9 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 Andrew Gainer-Dewar, Gamma-Species and the Enumeration of k-Trees, Electronic Journal of Combinatorics, Volume 19 (2012), #P45. - From N. J. A. Sloane, Dec 15 2012 CROSSREFS Cf. A054581 (unlabeled 2-trees), A078792 (unlabeled 3-trees), A078793 (unlabeled 4-trees), A201702 (unlabeled 5-trees) Sequence in context: A130756 A078793 A201702 * A322754 A224917 A274100 Adjacent sequences: A202034 A202035 A202036 * A202038 A202039 A202040 KEYWORD nonn AUTHOR Andrew R. Gainer, Dec 09 2011 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.

Last modified December 5 21:40 EST 2022. Contains 358594 sequences. (Running on oeis4.)