Search: a056331 -id:a056331
|
|
A276544
|
|
Triangle read by rows: T(n,k) = number of primitive (aperiodic) reversible string structures with n beads using exactly k different colors.
|
|
+10
10
|
|
|
1, 0, 1, 0, 2, 1, 0, 4, 4, 1, 0, 9, 15, 6, 1, 0, 16, 49, 37, 9, 1, 0, 35, 160, 183, 76, 12, 1, 0, 66, 498, 876, 542, 142, 16, 1, 0, 133, 1544, 3930, 3523, 1346, 242, 20, 1, 0, 261, 4715, 17179, 21392, 11511, 2980, 390, 25, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
A string and its reverse are considered to be equivalent. Permuting the colors will not change the structure.
|
|
REFERENCES
|
M. R. Nester (1999). Mathematical investigations of some plant interaction designs. PhD Thesis. University of Queensland, Brisbane, Australia. [See A056391 for pdf file of Chap. 2]
|
|
LINKS
|
|
|
FORMULA
|
T(n, k) = Sum_{d|n} mu(n/d) * A284949(d, k).
|
|
EXAMPLE
|
Triangle starts
1
0 1
0 2 1
0 4 4 1
0 9 15 6 1
0 16 49 37 9 1
0 35 160 183 76 12 1
0 66 498 876 542 142 16 1
0 133 1544 3930 3523 1346 242 20 1
0 261 4715 17179 21392 11511 2980 390 25 1
...
Primitive reversible word structures are:
n=1: a => 1
n=2: ab => 1
n=3: aab, aba; abc => 2 + 1
n=4: aaab, aaba, aabb, abba => 4 (k=2)
aabc, abac, abbc, abca => 4 (k=3)
|
|
MATHEMATICA
|
Ach[n_, k_] := Ach[n, k] = Switch[k, 0, If[n == 0, 1, 0], 1, If[n > 0, 1, 0], _, If[OddQ[n], Sum[Binomial[(n - 1)/2, i] Ach[n - 1 - 2 i, k - 1], {i, 0, (n - 1)/2}], Sum[Binomial[n/2 - 1, i] (Ach[n - 2 - 2 i, k - 1] + 2^i Ach[n - 2 - 2 i, k - 2]), {i, 0, n/2 - 1}]]]
T[n_, k_] := DivisorSum[n, MoebiusMu[n/#] (StirlingS2[#, k] + Ach[#, k])/2& ];
|
|
PROG
|
(PARI) \\ here Ach is A304972 as matrix.
Ach(n, m=n)={my(M=matrix(n, m, i, k, i>=k)); for(i=3, n, for(k=2, m, M[i, k]=k*M[i-2, k] + M[i-2, k-1] + if(k>2, M[i-2, k-2]))); M}
T(n, m=n)={my(M=matrix(n, m, i, k, stirling(i, k, 2)) + Ach(n, m)); matrix(n, m, i, k, sumdiv(i, d, moebius(i/d)*M[d, k]))/2}
{ my(A=T(10)); for(n=1, #A, print(A[n, 1..n])) } \\ Andrew Howroyd, Jan 09 2020
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|
|
A056336
|
|
Number of primitive (aperiodic) reversible string structures with n beads using exactly two different colors.
|
|
+10
1
|
|
|
0, 1, 2, 4, 9, 16, 35, 66, 133, 261, 527, 1032, 2079, 4123, 8244, 16440, 32895, 65639, 131327, 262380, 524762, 1049071, 2098175, 4195230, 8390646, 16779231, 33558392, 67112892, 134225919, 268443306
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
A string and its reverse are considered to be equivalent. Permuting the colors will not change the structure. Identical to A056331 for n>1.
|
|
REFERENCES
|
M. R. Nester (1999). Mathematical investigations of some plant interaction designs. PhD Thesis. University of Queensland, Brisbane, Australia. [See A056391 for pdf file of Chap. 2]
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
a[1] = 0;
a[n_] := DivisorSum[n, MoebiusMu[#] (2^(n/#-2) + 2^(Floor[n/#/2]-1))&];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|
|
A056337
|
|
Number of primitive (aperiodic) reversible string structures with n beads using exactly three different colors.
|
|
+10
1
|
|
|
0, 0, 1, 4, 15, 49, 160, 498, 1544, 4715, 14356, 43420, 131145, 394990, 1188564, 3572400, 10732065, 32224216, 96733636, 290317660, 871200664, 2614083394, 7843255300, 23531731530, 70599259170, 211805771345
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
A string and its reverse are considered to be equivalent. Permuting the colors will not change the structure.
|
|
REFERENCES
|
M. R. Nester (1999). Mathematical investigations of some plant interaction designs. PhD Thesis. University of Queensland, Brisbane, Australia. [See A056391 for pdf file of Chap. 2]
|
|
LINKS
|
|
|
FORMULA
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
Search completed in 0.009 seconds
|