|
Search: id:A106369
|
|
|
| A106369 |
|
Number of circular partitions of n such that no two adjacent parts are equal. |
|
+0
1
|
|
| 1, 1, 2, 2, 3, 6, 7, 11, 18, 29, 42, 73, 111, 183, 299, 491, 796, 1333, 2188, 3652, 6073, 10155, 16959, 28500, 47813, 80508, 135621, 228967, 386749, 654535, 1108353, 1879478, 3189495, 5418556, 9212099, 15676275, 26694509, 45493327, 77580915
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
LINKS
|
Index entries for sequences related to necklaces
|
|
FORMULA
|
CycleBG transform of (1, 1, 1, 1, ...)
CycleBG transform T(A) = invMOEBIUS(invEULER(Carlitz(A)) + A(x^2) - A) + A.
Carlitz transform T(A(x)) has g.f. 1/(1-sum(k>0, (-1)^(k+1)*A(x^k))).
|
|
EXAMPLE
|
a(6) = 6 because the 6 circular partitions of 6: 6, 5+1, 4+2, 3+2+1, 3+1+2, 2+1+2+1.
|
|
CROSSREFS
|
Cf. A000031, A008965.
Sequence in context: A091770 A032058 A039866 this_sequence A032062 A011141 A159915
Adjacent sequences: A106366 A106367 A106368 this_sequence A106370 A106371 A106372
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Christian G. Bower (bowerc(AT)usa.net), Apr 29 2005
|
|
|
Search completed in 0.002 seconds
|
