Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A034860
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A034860 n!*(2*n-5)/2. +0
1
3, 36, 300, 2520, 22680, 221760, 2358720, 27216000, 339292800, 4550515200, 65383718400, 1002550348800, 16345929600000, 282457663488000, 5157467707392000, 99236792438784000, 2007144156745728000 (list; graph; listen)
OFFSET

3,1
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 factorial numbers

CROSSREFS

Adjacent sequences: A034857 A034858 A034859 this_sequence A034861 A034862 A034863

Sequence in context: A056307 A056299 A073980 this_sequence A003691 A038146 A067444

KEYWORD

nonn

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 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research

Legal Notice
© 2007 AT&T Knowledge Ventures. All Rights Reserved.