Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136793
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136793 Number of unlabeled rooted trees with n 4-colored nodes. +0
2
4, 16, 104, 752, 5996, 50512, 444256, 4027360, 37383044, 353486320, 3393093696, 32976302800, 323839605124, 3208549483216, 32033691247528, 321955764477936, 3254812520854980, 33075467402453872 (list; graph; listen)
OFFSET

1,1

REFERENCES

F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Cambridge, 1998, pg 293 (4.1.60)

LINKS

N. J. A. Sloane, Transforms

Index entries for sequences related to rooted trees

FORMULA

Shifts left and divides by 4 under EULER transform. a(n) = A136794(n)*2 = A052763(n)*4.

CROSSREFS

Adjacent sequences: A136790 A136791 A136792 this_sequence A136794 A136795 A136796

Sequence in context: A074187 A111883 A094637 this_sequence A009630 A131043 A071554

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Jan 21 2008

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 January 7 17:35 EST 2009. Contains 152824 sequences.


AT&T Labs Research