id:A034864 - OEIS Search Results

Search: id:A034864

Displaying 1-1 of 1 results found.

page 1

a(5) = 5, a(6) = 1170, for n >= 7, a(n) = n!*(4*n^3-30*n^2+40*n+3)/24.

+0
1

5, 1170, 38850, 757680, 12836880, 212133600, 3554258400, 61372080000, 1100366467200, 20555914579200, 400638734496000, 8148554878464000, 172878910364160000, 3823017399032832000 (list; graph; listen)

	OFFSET	`5,1`
	REFERENCES	`J. Riordan, Enumeration of trees by height and diameter, IBM J. Res. Dev. 4 (1960), 473-478.`
	FORMULA	`a(n) = A034863(n), n>6. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 26 2008`
	CROSSREFS	`Sequence in context: A119549 A004805 A123266 this_sequence A069642 A066162 A096725` `Adjacent sequences: A034861 A034862 A034863 this_sequence A034865 A034866 A034867`
	KEYWORD	`nonn,easy`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:10 EDT 2008. Contains 143238 sequences.

AT&T Labs Research