OFFSET
0,7
COMMENTS
See A000676 for more information.
On the bottom of first page 266 of article Cayley (1881) is a table of A000676 and A000677 for n = 1..13. - Michael Somos, Aug 20 2018
REFERENCES
N. L. Biggs et al., Graph Theory 1736-1936, Oxford, 1976, p. 49.
A. Cayley, On the analytical forms called trees, with application to the theory of chemical combinations, Reports British Assoc. Advance. Sci. 45 (1875), 257-305 = Math. Papers, Vol. 9, 427-460 (see p. 438).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Geoffrey Critzer, Table of n, a(n) for n = 0..200 (replacing the first version from N. J. A. Sloane)
Jean-François Alcover, Mathematica program
A. Cayley, On the analytical forms called trees, Amer. J. Math., 4 (1881), 266-268.
E. M. Rains and N. J. A. Sloane, On Cayley's Enumeration of Alkanes (or 4-Valent Trees)., J. Integer Sequences, Vol. 2 (1999), Article 99.1.1.
J. Riordan, The enumeration of trees by height and diameter, IBM Journal 4 (1960), 473-478. (Annotated scanned copy)
N. J. A. Sloane, Maple program
Eric Weisstein's World of Mathematics, Bicentered Tree.
EXAMPLE
G.f. = x^2 + x^4 + x^5 + 3*x^6 + 4*x^7 + 11*x^8 + 20*x^9 + 51*x^10 + ... - Michael Somos, Aug 20 2018
MAPLE
See link for Maple program.
MATHEMATICA
See link.
CROSSREFS
KEYWORD
nonn,easy,nice
AUTHOR
STATUS
approved