login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A034864 a(5) = 5, a(6) = 1170, for n >= 7, a(n) = n!*(4*n^3-30*n^2+40*n+3)/24. 0
5, 1170, 38850, 757680, 12836880, 212133600, 3554258400, 61372080000, 1100366467200, 20555914579200, 400638734496000, 8148554878464000, 172878910364160000, 3823017399032832000 (list; graph; refs; listen; history; internal format)
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: A004805 A123266 A189249 * A157642 A069642 A066162

Adjacent sequences:  A034861 A034862 A034863 * A034865 A034866 A034867

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 19:07 EST 2012. Contains 206085 sequences.