The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A144529 Triangle read by rows: T(n,k) = number of edges in graph whose vertices are forests with n unlabeled nodes and degree <= k and in which two vertices are joined by an edge if the forests differ (up to isomorphism) by exactly one edge. 2
 0, 0, 1, 0, 1, 2, 0, 2, 5, 6, 0, 2, 9, 13, 14, 0, 3, 18, 32, 36, 37, 0, 3, 28, 67, 82, 87, 88 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 COMMENTS The number of nodes in this graph is given by A144215. LINKS R. Neville, Graphs whose vertices are forests with bounded degree, Graph Theory Notes of New York, LIV (2008), 12-21. EXAMPLE Triangle begins: 0 0 1 0 1 2 0 2 5 6 0 2 9 13 14 0 3 18 32 36 37 0 3 28 67 82 87 88 CROSSREFS Cf. A144530. Sequence in context: A305628 A094721 A301951 * A319498 A011297 A110282 Adjacent sequences:  A144526 A144527 A144528 * A144530 A144531 A144532 KEYWORD nonn,tabl,more AUTHOR N. J. A. Sloane, Dec 20 2008 STATUS approved

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

Last modified May 18 03:03 EDT 2021. Contains 343994 sequences. (Running on oeis4.)