|
Search: id:A052788
|
|
| |
|
| 0, 1, 5, 40, 360, 3570, 37476, 410490, 4635330, 53589045, 631115140, 7544876956, 91321148575, 1116879203135, 13781214640630, 171350293212360, 2144719821588471, 27001925967762160, 341717698703959875
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Number of rooted trees with 5-colored non-root nodes. (Christian G. Bower (bowerc(AT)usa.net), Sep 07 2002)
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 745
Index entries for sequences related to rooted trees
|
|
MAPLE
|
spec := [S, {B=Set(S), S=Prod(Z, B, B, B, B, B)}, unlabeled]: seq(combstruct[count](spec, size=n), n=0..20);
|
|
CROSSREFS
|
Adjacent sequences: A052785 A052786 A052787 this_sequence A052789 A052790 A052791
Sequence in context: A007036 A052798 A137973 this_sequence A130564 A124555 A079158
|
|
KEYWORD
|
easy,nonn,eigen
|
|
AUTHOR
|
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
|
|
Search completed in 0.002 seconds
|
