|
Search: id:A052817
|
|
|
| A052817 |
|
Cycles of rooted trees t where for each t all subtrees at root are distinct. n is total number of nodes. |
|
+0
1
|
|
| 0, 1, 2, 3, 6, 10, 22, 43, 97, 211, 481, 1090, 2535, 5870, 13774, 32383, 76607, 181709, 432865, 1033657, 2475869, 5943440, 14300623, 34475031, 83266498, 201441441, 488098768, 1184353854, 2877625762, 7000359245, 17049321176
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 782
|
|
MAPLE
|
spec := [S, {C=Prod(B, Z), B=PowerSet(C), S=Cycle(C)}, unlabeled]: seq(combstruct[count](spec, size=n), n=0..20);
|
|
CROSSREFS
|
Sequence in context: A074371 A032202 A125702 this_sequence A002992 A130867 A122381
Adjacent sequences: A052814 A052815 A052816 this_sequence A052818 A052819 A052820
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
|
|
Search completed in 0.002 seconds
|
