Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036661
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036661 Number of n-node rooted labeled trees with deg <=4 at root and out-degree <=2 elsewhere. +0
1
1, 1, 2, 4, 8, 15, 32, 66, 142, 306, 672, 1483, 3316, 7446, 16859, 38353, 87735, 201510, 464801, 1075744, 2498053, 5817576, 13585231, 31801732, 74615404, 175433624, 413281276, 975355639, 2305763635, 5459480822, 12945857671 (list; graph; listen)
OFFSET

0,3
LINKS

Index entries for sequences related to rooted trees

Index entries for sequences related to trees

FORMULA

G.f.: A(x) = x*cycle_index(S4, f), where f = A001190(x)/x.

Cf. A000671.

CROSSREFS

Sequence in context: A092603 A086125 A061030 this_sequence A108693 A007673 A026096

Adjacent sequences: A036658 A036659 A036660 this_sequence A036662 A036663 A036664

KEYWORD

nonn,easy

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 August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research

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