A056286 -id:A056286 - cp's OEIS frontend

A087854 Triangle read by rows: T(n,k) is the number of n-bead necklaces with exactly k different colored beads.

1, 1, 1, 1, 2, 2, 1, 4, 9, 6, 1, 6, 30, 48, 24, 1, 12, 91, 260, 300, 120, 1, 18, 258, 1200, 2400, 2160, 720, 1, 34, 729, 5106, 15750, 23940, 17640, 5040, 1, 58, 2018, 20720, 92680, 211680, 258720, 161280, 40320, 1, 106, 5613, 81876, 510312, 1643544, 2963520, 3024000, 1632960, 362880

Offset: 1

Philippe Deléham

Equivalently, T(n,k) is the number of sequences (words) of length n on an alphabet of k letters where each letter of the alphabet occurs at least once in the sequence. Two sequences are considered equivalent if one can be obtained from the other by a cyclic shift of the letters. Cf. A054631 where the surjective restriction is removed. - Geoffrey Critzer, Jun 18 2013

Robert A. Russell's g.f. for column k >= 1 (in the Formula section below) can be proved by integrating both sides of the formula Sum_{n>=1} S2(n, k)*x^(n-1) = x^(k-1)/((1 - x)* (1 - 2*x) * (1 - 3*x) * ... * (1 - k*x)) w.r.t. x. A variation of this identity (valid for |x| < 1/k) can be found in the Formula section of A008277. - Petros Hadjicostas, Aug 20 2019

			The triangle begins with T(1,1):
  1;
  1,   1;
  1,   2,    2;
  1,   4,    9,     6;
  1,   6,   30,    48,     24;
  1,  12,   91,   260,    300,     120;
  1,  18,  258,  1200,   2400,    2160,     720;
  1,  34,  729,  5106,  15750,   23940,   17640,    5040;
  1,  58, 2018, 20720,  92680,  211680,  258720,  161280,   40320;
  1, 106, 5613, 81876, 510312, 1643544, 2963520, 3024000, 1632960, 362880;
  ...
For T(4,2) = 4, the necklaces are AAAB, AABB, ABAB, and ABBB.
For T(4,4) = 6, the necklaces are ABCD, ABDC, ACBD, ACDB, ADBC, and ADCB.

Alois P. Heinz, Rows n = 1..141, flattened

Columns 1-6: A057427, A052823, A056283, A056284, A056285, A056286.
Diagonals: A000142 and A074143.
Row sums: A019536.
Cf. A000010 (Euler totient phi function), A008277 (Stirling2 numbers), A075195 (table of Jablonski).
Cf. A254040, A273891.

with(numtheory):
T:= (n, k)-> (k!/n) *add(phi(d) *Stirling2(n/d, k), d=divisors(n)):
seq(seq(T(n,k), k=1..n), n=1..12);  # Alois P. Heinz, Jun 19 2013

Table[Table[Sum[EulerPhi[d]*StirlingS2[n/d,k]k!,{d,Divisors[n]}]/n,{k,1,n}],{n,1,10}]//Grid (* Geoffrey Critzer, Jun 18 2013 *)

T(n, k) = (k!/n) * sumdiv(n, d, eulerphi(d) * stirling(n/d, k, 2)); \\ Joerg Arndt, Sep 25 2020

T(n,k) = Sum_{i=0..k-1} (-1)^i * C(k,i) * A075195(n,k-i); A075195 = Jablonski's table.
T(n,k) = (k!/n) * Sum_{d|n} phi(d) * S2(n/d, k), where S2(n,k) = Stirling numbers of 2nd kind A008277.
G.f. for column k: -Sum_{d>0} (phi(d)/d) * Sum_{j = 1..k} (-1)^(k-j) * C(k,j) * log(1 - j * x^d). - Robert A. Russell, Sep 26 2018
T(n,k) = Sum_{d|n} A254040(d, k) for n, k >= 1. - Petros Hadjicostas, Aug 19 2019

Formula section edited by Petros Hadjicostas, Aug 20 2019

A056492 Number of periodic palindromes using exactly six different symbols.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 360, 720, 7920, 15120, 103320, 191520, 1048320, 1905120, 9170280, 16435440, 72833040, 129230640, 541130040, 953029440, 3832187040, 6711344640, 26192766600, 45674188560, 174286672560, 302899156560, 1136023139160, 1969147121760

Offset: 1

Marks R. Nester

			For example, aaabbb is not a (finite) palindrome but it is a periodic palindrome.
There are 720 permutations of the six letters used in ABACDEFEDC.  These 720 arrangements can be paired up with a half turn (e.g., ABACDEFEDC-EFEDCABACD) to arrive at the 360 arrangements for n=10.

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]

Muniru A Asiru, Table of n, a(n) for n = 1..500
Index entries for linear recurrences with constant coefficients, signature (1,20,-20,-155,155,580,-580,-1044, 1044,720,-720).

Cf. A056286, A056346, A056457.

Column 6 of A305540.

a:=[0,0,0,0,0,0,0,0,0,360,720];; for n in [12..35] do a[n]:=a[n-1] +20*a[n-2]-20*a[n-3]-155*a[n-4]+155*a[n-5]+580*a[n-6] -580*a[n-7] -1044*a[n-8]+1044*a[n-9]+720*a[n-10]-720*a[n-11]; od; a; # Muniru A Asiru, Sep 26 2018

m:=50; R:=PowerSeriesRing(Integers(), m); [0, 0, 0, 0, 0, 0, 0, 0, 0] cat Coefficients(R!(360*x^10*(x+1)/((x-1)*(2*x-1)*(2*x+1)*(2*x^2-1)*(3*x^2-1)*(5*x^2-1)*(6*x^2-1)))); // G. C. Greubel, Oct 13 2018

with(combinat):  a:=n->(factorial(6)/2)*(Stirling2(floor((n+1)/2),6)+Stirling2(ceil((n+1)/2),6)): seq(a(n),n=1..35); # Muniru A Asiru, Sep 26 2018

k = 6; Table[(k!/2) (StirlingS2[Floor[(n + 1)/2], k] + StirlingS2[Ceiling[(n + 1)/2], k]), {n, 1, 40}] (* Robert A. Russell, Jun 05 2018 *)
LinearRecurrence[{1,20,-20,-155,155,580,-580,-1044,1044,720,-720}, Join[Table[0,{9}],{360,720}],40] (* Robert A. Russell, Sep 29 2018 *)

a(n) = my(k=6); (k!/2)*(stirling(floor((n+1)/2), k, 2) + stirling(ceil((n+1)/2), k, 2)); \\ Michel Marcus, Jun 05 2018

a(n) = 2*A056346(n) - A056286(n).
G.f.: 360*x^10*(x+1)/((x-1)*(2*x-1)*(2*x+1)*(2*x^2-1)*(3*x^2-1)*(5*x^2-1)*(6*x^2-1)). - Colin Barker, Jul 08 2012
a(n) = (k!/2)*(S2(floor((n+1)/2),k) + S2(ceiling((n+1)/2),k)), with k=6 different colors used and where S2(n,k) is the Stirling subset number A008277. - Robert A. Russell, Jun 05 2018
a(n) = a(n-1) + 20*a(n-2) - 20*a(n-3) - 155*a(n-4) + 155*a(n-5) + 580*a(n-6) - 580*a(n-7) - 1044*a(n-8) + 1044*a(n-9) + 720*a(n-10) - 720*a(n-11). - Muniru A Asiru, Sep 26 2018

A056291 Number of primitive (period n) n-bead necklaces with exactly six different colored beads.

Original entry on oeis.org

0, 0, 0, 0, 0, 120, 2160, 23940, 211680, 1643544, 11748240, 79419060, 516257280, 3262440960, 20193277104, 123071683140, 741419995680, 4427489935680, 26264144909520, 155018839412052, 911509010152560, 5344538372696880, 31272099902089200, 182707081042818360

Offset: 1

Marks R. Nester

nonn

Turning over the necklace is not allowed.

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]

Alois P. Heinz, Table of n, a(n) for n = 1..1000

Cf. A032164.

Column k=6 of A254040.

with(numtheory):
b:= proc(n, k) option remember; `if`(n=0, 1,
      add(mobius(n/d)*k^d, d=divisors(n))/n)
    end:
a:= n-> add(b(n, 6-j)*binomial(6, j)*(-1)^j, j=0..6):
seq(a(n), n=1..30);  # Alois P. Heinz, Jan 25 2015

b[n_, k_] := b[n, k] = If[n==0, 1, DivisorSum[n, MoebiusMu[n/#]*k^# &]/n];
a[n_] := Sum[b[n, 6 - j]*Binomial[6, j]*(-1)^j, {j, 0, 6}];
Table[a[n], {n, 1, 30}] (* Jean-François Alcover, Jun 06 2018, after Alois P. Heinz *)

Sum mu(d)*A056286(n/d) where d|n.

A056299 Number of n-bead necklace structures using exactly six different colored beads.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 3, 36, 296, 2303, 16317, 110462, 717024, 4532105, 28046285, 170938814, 1029749994, 6149327905, 36477979041, 215304158916, 1265984738264, 7422971231829, 43433472086235, 253759842223290

Offset: 1

Marks R. Nester

nonn

Turning over the necklace is not allowed. Colors may be permuted without changing the necklace structure.

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]

E. N. Gilbert and J. Riordan, Symmetry types of periodic sequences, Illinois J. Math., 5 (1961), 657-665.

Column 6 of A152175.

Cf. A056286, A056293, A056294.

From Robert A. Russell, May 29 2018: (Start)
Adn[d_, n_] := Adn[d, n] = If[1==n, DivisorSum[d, x^# &],
  Expand[Adn[d, 1] Adn[d, n-1] + D[Adn[d, n-1], x] x]];
Table[Coefficient[DivisorSum[n, EulerPhi[#] Adn[#, n/#] &]/n , x, 6],
  {n, 1, 40}] (* after Gilbert and Riordan *)
Table[(1/n) DivisorSum[n, EulerPhi[#] Which[Divisible[#, 60], StirlingS2[n/#+5, 6] - 10 StirlingS2[n/#+4, 6] + 35 StirlingS2[n/#+3, 6] - 50 StirlingS2[n/#+2, 6] + 24 StirlingS2[n/#+1, 6], Divisible[#, 30], StirlingS2[n/#+5, 6] - 12 StirlingS2[n/#+4, 6] + 56 StirlingS2[n/#+3, 6] - 123 StirlingS2[n/#+2, 6] + 108 StirlingS2[n/#+1, 6], Divisible[#, 20], 4 StirlingS2[n/#+4, 6] - 44 StirlingS2[n/#+3, 6] + 176 StirlingS2[n/#+2, 6] - 296 StirlingS2[n/#+1, 6] + 160 StirlingS2[n/#, 6], Divisible[#, 15], 3 StirlingS2[n/#+4, 6] - 36 StirlingS2[n/#+3, 6] + 159 StirlingS2[n/#+2, 6] - 306 StirlingS2[n/#+1, 6] + 225 StirlingS2[n/#, 6], Divisible[#, 12], StirlingS2[n/#+5, 6] - 12 StirlingS2[n/#+4, 6] + 59 StirlingS2[n/#+3, 6] - 156 StirlingS2[n/#+2, 6] + 228 StirlingS2[n/#+1, 6] - 144 StirlingS2[n/#, 6], Divisible[#, 10], 2 StirlingS2[n/#+4, 6] - 23 StirlingS2[n/#+3, 6] + 103 StirlingS2[n/#+2, 6] - 212 StirlingS2[n/#+1, 6] + 160 StirlingS2[n/#, 6], Divisible[#, 6], StirlingS2[n/#+5, 6] - 14 StirlingS2[n/#+4, 6] + 80 StirlingS2[n/#+3, 6] - 229 StirlingS2[n/#+2, 6] + 312 StirlingS2[n/#+1, 6] - 144 StirlingS2[n/#, 6], Divisible[#, 5], 2 StirlingS2[n/#+4, 6] - 24 StirlingS2[n/#+3, 6] + 106 StirlingS2[n/#+2, 6] - 204 StirlingS2[n/#+1, 6] + 145 StirlingS2[n/#, 6], Divisible[#, 4], 2 StirlingS2[n/#+4, 6] - 20 StirlingS2[n/#+3, 6] + 70 StirlingS2[n/#+2, 6] - 92 StirlingS2[n/#+1, 6] + 16 StirlingS2[n/#, 6], Divisible[#, 3], StirlingS2[n/#+4, 6] - 12 StirlingS2[n/#+3, 6] + 53 StirlingS2[n/#+2, 6] - 102 StirlingS2[n/#+1, 6] + 81 StirlingS2[n/#, 6], Divisible[#, 2], StirlingS2[n/#+3, 6] - 3 StirlingS2[n/#+2, 6] - 8 StirlingS2[n/#+1, 6] + 16 StirlingS2[n/#, 6], True, StirlingS2[n/#, 6]] &], {n, 1, 40}]
mx = 40; Drop[CoefficientList[Series[-Sum[(EulerPhi[d] / d) Which[
  Divisible[d, 60], Log[1 - 6x^d] - Log[1 - 5x^d], Divisible[d, 30],
  (3 Log[1 - 6x^d] - 3 Log[1 - 5x^d] + Log[1 - 2x^d] - Log[1 - x^d]) / 4,
  Divisible[d, 20], (5 Log[1 - 6x^d] - 6 Log[1 - 5x^d] + 2 Log[1 - 3x^d] -
  3 Log[1 - 2x^d]) / 9, Divisible[d, 15], (5 Log[1 - 6x^d] -
  6 Log[1 - 5x^d] + 3 Log[1 - 4x^d] - 4 Log[1 - 3x^d] + 3 Log[1 - 2x^d] -
  6 Log[1 - x^d]) / 16, Divisible[d, 12], (4 Log[1 - 6x^d] -
  4 Log[1 - 5x^d] + Log[1 - x^d]) / 5, Divisible[d, 10], (11 Log[1 - 6x^d] -
  15 Log[1 - 5x^d] + 8 Log[1 - 3x^d] - 3 Log[1 - 2x^d] - 9 Log[1 - x^d]) /
  36, Divisible[d, 6], (11 Log[1 - 6x^d] - 11 Log[1 - 5x^d] +
  5 Log[1 - 2x^d] - Log[1 - x^d]) / 20, Divisible[d, 5], (29 Log[1 - 6x^d] -
  30 Log[1 - 5x^d] + 3 Log[1 - 4x^d] - 4 Log[1 - 3x^d] + 3 Log[1 - 2x^d] -
  30 Log[1 - x^d]) / 144, Divisible[d, 4], (16 Log[1 - 6x^d] -
  21 Log[1 - 5x^d] + 10 Log[1 - 3x^d] - 15 Log[1 - 2x^d] + 9 Log[1 - x^d]) /
  45, Divisible[d, 3], (9 Log[1 - 6x^d] - 14 Log[1 - 5x^d] +
  15 Log[1 - 4x^d] - 20 Log[1 - 3x^d] + 15 Log[1 - 2x^d] -
  14 Log[1 - x^d]) / 80, Divisible[d, 2], (19 Log[1 - 6x^d] -
  39 Log[1 - 5x^d] + 40 Log[1 - 3x^d] - 15 Log[1 - 2x^d] - 9 Log[1 - x^d]) /
  180, True, (Log[1 - 6x^d] - 6 Log[1 - 5x^d] + 15 Log[1 - 4x^d] -
  20 Log[1 - 3x^d] + 15 Log[1 - 2x^d] - 6 Log[1 - x^d]) / 720],
  {d, 1, mx}], {x, 0, mx}], x], 1]
(End)

a(n) = A056294(n) - A056293(n).
From Robert A. Russell, May 29 2018: (Start)
a(n) = (1/n) * Sum_{d|n} phi(d) * ([d==0 mod 60] * (S2(n/d+5,6) -
  10*S2(n/d+4,6) + 35*S2(n/d+3,6) - 50*S2(n/d+2,6) + 24*S2(n/d+1,6)) +
  [d==30 mod 60] * (S2(n/d+5,6) - 12*S2(n/d+4,6) + 56*S2(n/d+3,6) -
  123*S2(n/d+2,6) + 108*S2(n/d+1,6)) + [d==20 mod 60 | d==40 mod 60] *
  (4*S2(n/d+4,6) - 44*S2(n/d+3,6) + 176*S2(n/d+2,6) - 296*S2(n/d+1,6) +
  160*S2(n/d,6)) + [d==15 mod 60 | d==45 mod 60] * (3*S2(n/d+4,6) -
  36*S2(n/d+3,6) + 159*S2(n/d+2,6) - 306*S2(n/d+1,6) + 225*S2(n/d,6)) +
  [d mod 60 in {12,24,36,48}] * (S2(n/d+5,6) - 12*S2(n/d+4,6) +
  59*S2(n/d+3,6) - 156*S2(n/d+2,6) + 228*S2(n/d+1,6) - 144*S2(n/d,6)) +
  [d=10 mod 60 | d==50 mod 60] * (2*S2(n/d+4,6) - 23*S2(n/d+3,6) +
  103*S2(n/d+2,6) - 212*S2(n/d+1,6) + 160*S2(n/d,6)) + [d mod 60 in
  {6,18,42,54}] * (S2(n/d+5,6) - 14*S2(n/d+4,6) + 80*S2(n/d+3,6) -
  229*S2(n/d+2,6) + 312*S2(n/d+1,6) - 144*S2(n/d,6)) + [d mod 60 in
  {5,25,35,55}] * (2*S2(n/d+4,6) - 24*S2(n/d+3,6) + 106*S2(n/d+2,6) -
  204*S2(n/d+1,6) + 145*S2(n/d,6)) + [d mod 60 in {4,8,16,28,32,44,52,56}] *
  (2*S2(n/d+4,6) - 20*S2(n/d+3,6) + 70*S2(n/d+2,6) - 92*S2(n/d+1,6) +
  16*S2(n/d,6)) + [d mod 60 in {3,9,21,27,33,39,51,57}] * (S2(n/d+4,6) -
  12*S2(n/d+3,6) + 53*S2(n/d+2,6) - 102*S2(n/d+1,6) + 81*S2(n/d,6)) +
  [d mod 60 in {2,14,22,26,34,38,46,58}] * (S2(n/d+3,6) - 3*S2(n/d+2,6) -
  8*S2(n/d+1,6) + 16*S2(n/d,6)) + [d mod 60 in {1,7,11,13,17,19,23,29,31,37,
  41,43,47,49,53,59}] * S2(n/d,6)), where S2(n,k) is the Stirling subset
  number, A008277.
G.f.: -Sum_{d>0} (phi(d) / d) * ([d==0 mod 60] * (log(1-6x^d) -
  log(1-5x^d)) + [d==30 mod 60] * (3*log(1-6x^d) - 3*log(1-5x^d) +
  log(1-2x^d) - log(1-x^d)) / 4 + [d==20 mod 60 | d==40 mod 60] *
  (5*log(1-6x^d) - 6*log(1-5x^d) + 2*log(1-3x^d) - 3*log(1-2x^d)) / 9 +
  [d==15 mod 60 | d==45 mod 60] * (5*log(1-6x^d) - 6*log(1-5x^d) +
  3*log(1-4x^d) - 4*log(1-3x^d) + 3*log(1-2x^d) - 6*log(1-x^d)) / 16 +
  [d mod 60 in {12,24,36,48}] * (4*log(1-6x^d) - 4*log(1-5x^d) +
  log(1-x^d)) / 5 + [d=10 mod 60 | d==50 mod 60] * (11*log(1-6x^d) -
  15*log(1-5x^d) + 8*log(1-3x^d) - 3*log(1-2x^d) - 9*log(1-x^d)) / 36 +
  [d mod 60 in {6,18,42,54}] * (11*log(1-6x^d) - 11*log(1-5x^d) +
  5*log(1-2x^d) - log(1-x^d)) / 20 + [d mod 60 in {5,25,35,55}] *
  (29*log(1-6x^d) - 30*log(1-5x^d) + 3*log(1-4x^d) - 4*log(1-3x^d) +
  3*log(1-2x^d) - 30*log(1-x^d)) / 144 + [d mod 60 in {4,8,16,28,32,44,52,
  56}] * (16*log(1-6x^d) - 21*log(1-5x^d) + 10*log(1-3x^d) -
  15*log(1-2x^d) + 9*log(1-x^d)) / 45 + [d mod 60 in {3,9,21,27,33,39,51, 57}] * (9*log(1-6x^d) - 14*log(1-5x^d) + 15*log(1-4x^d) - 20*log(1-3x^d) +
  15*log(1-2x^d) - 14*log(1-x^d)) / 80 + [d mod 60 in {2,14,22,26,34,38,46,
  58}] * (19*log(1-6x^d) - 39*log(1-5x^d) + 40*log(1-3x^d) -
  15*log(1-2x^d) - 9*log(1-x^d)) / 180 + [d mod 60 in {1,7,11,13,17,19,23, 29,31,37,41,43,47,49,53,59}] * (log(1-6x^d) - 6 log(1-5x^d) +
  15 log(1-4x^d) - 20 log(1-3x^d) + 15 log(1-2x^d) - 6 log(1-x^d)) / 720).
(End)

A056346 Number of bracelets of length n using exactly six different colored beads.

Original entry on oeis.org

0, 0, 0, 0, 0, 60, 1080, 11970, 105840, 821952, 5874480, 39713550, 258136200, 1631273220, 10096734312, 61536377700, 370710950400, 2213749658880, 13132080672480, 77509456944318, 455754569692680

Offset: 1

Marks R. Nester

nonn

Turning over will not create a new bracelet.

			For a(6)=60, pair up the 120 permutations of BCDEF, each with its reverse, such as BCDEF-FEDCB.  Precede the first of each pair with an A, such as ABCDEF.  These are the 60 arrangements, all chiral.  If we precede the second of each pair with an A, such as AFEDCB, we get the chiral partner of each. - _Robert A. Russell_, Sep 27 2018

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]

Column 6 of A273891.
Equals (A056286 + A056492) / 2 = A056286 - A305545 = A305545 + A056492.
Cf. A008277.

t[n_, k_] := (For[t1 = 0; d = 1, d <= n, d++, If[Mod[n, d] == 0, t1 = t1 + EulerPhi[d]*k^(n/d)]]; If[EvenQ[n], (t1 + (n/2)*(1 + k)*k^(n/2))/(2*n), (t1 + n*k^((n + 1)/2))/(2*n)]);
T[n_, k_] := Sum[(-1)^i*Binomial[k, i]*t[n, k - i], {i, 0, k - 1}];
a[n_] := T[n, 6];
Array[a, 21] (* Jean-François Alcover, Nov 05 2017, after Andrew Howroyd *)
k=6; Table[k! DivisorSum[n, EulerPhi[#] StirlingS2[n/#,k]&]/(2n) + k!(StirlingS2[Floor[(n+1)/2], k] + StirlingS2[Ceiling[(n+1)/2], k])/4, {n,1,30}] (* Robert A. Russell, Sep 27 2018 *)

a(n) = my(k=6); (k!/4) * (stirling(floor((n+1)/2),k,2) + stirling(ceil((n+1)/2),k,2)) + (k!/(2*n))*sumdiv(n, d, eulerphi(d)*stirling(n/d,k,2)); \\ Michel Marcus, Sep 29 2018

a(n) = A056341(n) - 6*A032276(n) + 15*A032275(n) - 20*A027671(n) + 15*A000029(n) - 6.
From Robert A. Russell, Sep 27 2018: (Start)
a(n) = (k!/4) * (S2(floor((n+1)/2),k) + S2(ceiling((n+1)/2),k)) + (k!/2n) * Sum_{d|n} phi(d) * S2(n/d,k), where k=6 is the number of colors and S2 is the Stirling subset number A008277.
G.f.: (k!/4) * x^(2k-2) * (1+x)^2 / Product_{i=1..k} (1-i x^2) - Sum_{d>0} (phi(d)/2d) * Sum_{j} (-1)^(k-j) * C(k,j) * log(1-j x^d), where k=6 is the number of colors. (End)

cp's OEIS Frontend

A087854 Triangle read by rows: T(n,k) is the number of n-bead necklaces with exactly k different colored beads.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A056492 Number of periodic palindromes using exactly six different symbols.

Views

Author

Keywords

Examples

References

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Formula

A056291 Number of primitive (period n) n-bead necklaces with exactly six different colored beads.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A056299 Number of n-bead necklace structures using exactly six different colored beads.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Formula

A056346 Number of bracelets of length n using exactly six different colored beads.

Views

Author

Keywords

Comments

Examples

References

Crossrefs

Programs

Mathematica

PARI

Formula