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.
%I A201702 #33 Feb 16 2025 08:33:16 %S A201702 0,0,0,0,1,1,1,2,5,15,64,342,2321,18578,168287,1656209,17288336, %T A201702 188006362,2105867058,24108331027,280638347609,3310098377912, %U A201702 39462525169310,474697793413215,5754095507495584,70216415130786725,861924378411516159,10636562125193377459 %N A201702 Number of unlabeled 5-trees on n nodes. %C A201702 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. %D A201702 Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, page 328. %H A201702 Allan Bickle, <a href="https://doi.org/10.20429/tag.2024.000105">A Survey of Maximal k-degenerate Graphs and k-Trees</a>, Theory and Applications of Graphs 0 1 (2024) Article 5. %H A201702 Andrew Gainer-Dewar, <a href="https://doi.org/10.37236/2615">Gamma-Species and the Enumeration of k-Trees</a>, Electronic Journal of Combinatorics, Volume 19 (2012), #P45. - From _N. J. A. Sloane_, Dec 15 2012 %H A201702 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/k-Tree.html">k-Tree</a> %Y A201702 Column k=5 of A370770. %Y A201702 Cf. A054581 (unlabeled 2-trees), A078792 (unlabeled 3-trees), A078793 (unlabeled 4-trees). %K A201702 nonn %O A201702 1,8 %A A201702 _Andrew R. Gainer_, Dec 03 2011