Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A034857
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A034857 C(n+2,3)+2*C(n,2)+2*(n-2). +0
1
-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; listen)
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

Adjacent sequences: A034854 A034855 A034856 this_sequence A034858 A034859 A034860

Sequence in context: A111147 A069958 A028896 this_sequence A116367 A101853 A132432

KEYWORD

sign

AUTHOR

njas

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 15 20:12 EDT 2008. Contains 145099 sequences.


AT&T Labs Research