A320093 -id:A320093 - cp's OEIS frontend

A143327 Table T(n,k) by antidiagonals. T(n,k) is the number of primitive (=aperiodic) k-ary words (n,k >= 1) with length less than or equal to n which are earlier in lexicographic order than any other word derived by cyclic shifts of the alphabet.

1, 1, 1, 1, 2, 1, 1, 3, 5, 1, 1, 4, 11, 11, 1, 1, 5, 19, 35, 26, 1, 1, 6, 29, 79, 115, 53, 1, 1, 7, 41, 149, 334, 347, 116, 1, 1, 8, 55, 251, 773, 1339, 1075, 236, 1, 1, 9, 71, 391, 1546, 3869, 5434, 3235, 488, 1, 1, 10, 89, 575, 2791, 9281, 19493, 21754, 9787, 983, 1, 1, 11

Offset: 1

Alois P. Heinz, Aug 07 2008

The coefficients of the polynomial of row n are given by the n-th row of triangle A134541; for example row 4 has polynomial -1+k^2+k^3.

			T(3,3) = 11, because 11 words of length <=3 over 3-letter alphabet {a,b,c} are primitive and earlier than others derived by cyclic shifts of the alphabet: a, ab, ac, aab, aac, aba, abb, abc, aca, acb, acc.
Table begins:
  1,   1,    1,     1,     1,      1,      1,       1, ...
  1,   2,    3,     4,     5,      6,      7,       8, ...
  1,   5,   11,    19,    29,     41,     55,      71, ...
  1,  11,   35,    79,   149,    251,    391,     575, ...
  1,  26,  115,   334,   773,   1546,   2791,    4670, ...
  1,  53,  347,  1339,  3869,   9281,  19543,   37367, ...
  1, 116, 1075,  5434, 19493,  55936, 137191,  299510, ...
  1, 236, 3235, 21754, 97493, 335656, 960391, 2396150, ...

Alois P. Heinz, Antidiagonals n = 1..141, flattened
Index entries for sequences related to Lyndon words

Columns k=1-10 give: A000012, A085945, A320087, A320088, A320089, A320090, A320091, A320092, A320093, A320094.
Rows n=1-4 give: A000012, A000027, A028387, A003777.
Main diagonal gives A320095.
Cf. A143325, A143326, A134541, A008683.

with(numtheory):
f1:= proc (n) option remember; unapply(k^(n-1)
        -add(f1(d)(k), d=divisors(n) minus {n}), k)
     end:
g1:= proc(n) option remember; unapply(add(f1(j)(x), j=1..n), x) end:
T:= (n, k)-> g1(n)(k):
seq(seq(T(n, 1+d-n), n=1..d), d=1..12);

t[n_, k_] := Sum[k^(d-1)*MoebiusMu[j/d], {j, 1, n}, {d, Divisors[j]}]; Table[t[n-k+1, k], {n, 1, 12}, {k, n, 1, -1}] // Flatten (* Jean-François Alcover, Dec 13 2013 *)

T(n,k) = Sum_{j=1..n} Sum_{d|j} k^(d-1) * mu(j/d).
T(n,k) = Sum_{j=1..n} A143325(j,k).
T(n,k) = A143326(n,k) / k.

A320074 Number of length n primitive (=aperiodic or period n) 9-ary words which are earlier in lexicographic order than any other word derived by cyclic shifts of the alphabet.

Original entry on oeis.org

1, 8, 80, 720, 6560, 58960, 531440, 4782240, 43046640, 387413920, 3486784400, 31380999840, 282429536480, 2541865296880, 22876792448320, 205891127311680, 1853020188851840, 16677181656560880, 150094635296999120, 1350851717285570880, 12157665459056397280

Offset: 1

Alois P. Heinz, Oct 05 2018

nonn

Dirichlet convolution of mu(n) with 9^(n-1).

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

Column k=9 of A143325.
First differences of A320093.
Cf. A008683, A074650, A143324.

a:= n-> add(`if`(d=n, 9^(n-1), -a(d)), d=numtheory[divisors](n)):
seq(a(n), n=1..25);

a(n) = Sum_{d|n} 9^(d-1) * mu(n/d).

a(n) = 9^(n-1) - Sum_{d

a(n) = A143325(n,9).

a(n) = A074650(n,9) * n/9.

a(n) = A143324(n,9) / 9.

G.f.: Sum_{k>=1} mu(k)*x^k/(1 - 9*x^k). - Ilya Gutkovskiy, Oct 25 2018

Showing 1-2 of 2 results.

cp's OEIS Frontend

A143327 Table T(n,k) by antidiagonals. T(n,k) is the number of primitive (=aperiodic) k-ary words (n,k >= 1) with length less than or equal to n which are earlier in lexicographic order than any other word derived by cyclic shifts of the alphabet.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula