A259864 Number of free highly irregular trees with n nodes.

1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 2, 2, 5, 7, 14, 19, 28, 36, 51, 68, 99, 128, 164, 203, 272, 203, 272, 375, 576, 870, 1392, 2202, 3564, 5657, 9038, 14105, 21899

Offset

1,16

Links

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

Alavi, Yousef, Gary Chartrand, Fan RK Chung, Paul Erdős, Ronald L. Graham, and Ortrud R. Oellermann, Highly irregular graphs, Journal of Graph Theory, 11, no. 2 (1987): 235-249.

K. A. McKeon, Letter to N. J. A. Sloane, Jul 25 1991. Gives a(n) for n <= 40.

Crossrefs

Cf. A259863.

Sequence in context: A095330 A036378 A265813 * A028303 A255063 A195964

Adjacent sequences: A259861 A259862 A259863 * A259865 A259866 A259867

Keyword

nonn,more

Author

N. J. A. Sloane, Jul 08 2015

Status

approved