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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A034857 C(n+2,3)+2*C(n,2)+2*(n-2). 0
-1, 6, 18, 36, 61, 94, 136, 188, 251, 326, 414, 516, 633, 766, 916, 1084, 1271, 1478, 1706, 1956, 2229, 2526, 2848, 3196, 3571, 3974, 4406, 4868, 5361, 5886, 6444, 7036, 7663, 8326, 9026, 9764, 10541, 11358 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

REFERENCES

J. Riordan, Enumeration of trees by height and diameter, IBM J. Res. Dev. 4 (1960), 473-478.

FORMULA

(n^3 + 9n^2 + 8n - 24)/6. - Ralf Stephan, Feb 15 2004

CROSSREFS

Sequence in context: A152539 A069958 A028896 * A116367 A180438 A202366

Adjacent sequences:  A034854 A034855 A034856 * A034858 A034859 A034860

KEYWORD

sign

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 10:05 EST 2012. Contains 206009 sequences.