|
Search: id:A011796
|
|
|
| A011796 |
|
Number of irreducible alternating Euler sums of depth 6 and weight 6+2n. |
|
+0
3
|
|
| 1, 3, 9, 20, 42, 75, 132, 212, 333, 497, 728, 1026, 1428, 1932, 2583, 3384, 4389, 5598, 7084, 8844, 10962, 13442, 16380, 19776, 23751, 28301, 33561, 39536, 46376, 54081, 62832, 72624, 83655, 95931, 109668, 124866, 141778, 160398
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(n-6)=number of aperiodic necklaces (Lyndon words) with 6 black beads and n-6 white beads.
|
|
LINKS
|
Index entries for sequences related to Lyndon words
D. J. Broadhurst, On the enumeration of irreducible k-fold Euler sums and their roles in knot theory and field theory
|
|
FORMULA
|
G.f.: (1+x+2x^2+2x^3+3x^4+2x^6+x^7)/((1-x)^2(1-x^2)^2(1-x^3)(1-x^6)).
|
|
MAPLE
|
(Maple) a := n -> (Matrix([[42, 20, 9, 3, 1, 0$7, -1, -4, -9]]). Matrix(15, (i, j)-> if (i=j-1) then 1 elif j=1 then [2, 1, -3, -1, 1, 4, -3, -3, 4, 1, -1, -3, 1, 2, -1][i] else 0 fi)^(n-5))[1, 1] ; seq (a(n), n=1..38); [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), Aug 04 2008]
|
|
CROSSREFS
|
Cf. A000031, A001037, A051168. a(n) = T(n, 6), array T as in A051168.
Sequence in context: A145068 A027114 A145070 this_sequence A164680 A073801 A065891
Adjacent sequences: A011793 A011794 A011795 this_sequence A011797 A011798 A011799
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), David Broadhurst (D.Broadhurst(AT)open.ac.uk)
|
|
|
Search completed in 0.002 seconds
|
