|
Search: id:A052821
|
|
|
| A052821 |
|
A simple grammar: pairs of cycles of sequences. |
|
+0
1
|
|
| 0, 0, 1, 4, 10, 22, 43, 84, 157, 294, 551, 1032, 1941, 3666, 6955, 13224, 25269, 48362, 92875, 178640, 344453
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 786
|
|
FORMULA
|
G.f.: Sum(numtheory[phi](j[1])/j[1]*ln((x^j[1]-1)/(2*x^j[1]-1)), j[1]=1 .. infinity)^2
|
|
MAPLE
|
pairs spec := [S, {B=Sequence(Z, 1 <= card), C=Cycle(B), S=Prod(C, C)}, unlabeled]: seq(combstruct[count](spec, size=n), n=0..20);
|
|
CROSSREFS
|
Adjacent sequences: A052818 A052819 A052820 this_sequence A052822 A052823 A052824
Sequence in context: A023626 A048574 A052837 this_sequence A023628 A004798 A038621
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
|
|
Search completed in 0.002 seconds
|
