id:A034853 - OEIS Search Results

Search: id:A034853

Displaying 1-1 of 1 results found.

page 1

Triangle giving number of trees with n >= 3 nodes and diameter d>=2.

+0
1

1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 5, 2, 1, 1, 3, 8, 7, 3, 1, 1, 3, 14, 14, 11, 3, 1, 1, 4, 21, 32, 29, 14, 4, 1, 1, 4, 32, 58, 74, 42, 19, 4, 1, 1, 5, 45, 110, 167, 128, 66, 23, 5, 1 (list; table; graph; listen)

	OFFSET	`3,8`
	REFERENCES	`J. Riordan, Enumeration of trees by height and diameter, IBM J. Res. Dev. 4 (1960), 473-478.`
	LINKS	`Index entries for sequences related to trees`
	FORMULA	`Reference gives recurrence.`
	EXAMPLE	`1; 1 1; 1 1 1; 1 2 2 1; 1 2 5 2 1; ...`
	CROSSREFS	`Sequence in context: A104156 A070166 A131373 this_sequence A110283 A079692 A110269` `Adjacent sequences: A034850 A034851 A034852 this_sequence A034854 A034855 A034856`
	KEYWORD	`nonn,tabl,easy,nice`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

page 1

Search completed in 0.002 seconds

Last modified December 9 18:50 EST 2009. Contains 170568 sequences.

AT&T Labs Research