Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A034866
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A034866 n!*(n-4)/2, n>4. +0
1
4, 60, 720, 7560, 80640, 907200, 10886400, 139708800, 1916006400, 28021593600, 435891456000, 7192209024000, 125536739328000, 2311968282624000, 44816615940096000, 912338253066240000 (list; graph; listen)
OFFSET

4,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

FORMULA

a(n)=A034865(n), n>4. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 20 2008]

CROSSREFS

Sequence in context: A112041 A002060 A007220 this_sequence A055315 A013482 A123480

Adjacent sequences: A034863 A034864 A034865 this_sequence A034867 A034868 A034869

KEYWORD

nonn

AUTHOR

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

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research