OFFSET
0
COMMENTS
P(n,x) is the denominator of the sum given in the Formula section.
Conjecture 1: Sum_{j=1..(-1)^A001221(n)*A023900(n)} root(P(n,x) = 0, j)^k = (-1)^A001221(n)*A023900(GCD(n, k)), which means there is a loop:
Conjecture 2: P(n,1) = A020500(n), for n >= 1.
Conjecture 3: P(A005117(j),x) = Phi(A005117(j),x), j >= 2, where Phi(n,x) are the cyclotomic polynomials in A013595.
The roots of P(n,x) = 0 are found in A374412.
The sum from the Formula section is equal to F_n(x) = -(-1)^omega(n)*f'(x)/f(x) where f(x) is the rad(n)-th cyclotomic polynomial (which implies f(x^A003557(n)) = Phi_n(x)), for n > 1. Conjectures 2 and 3 follow immediately. For p prime, F_{n*p}(x) = F_n(x) - [p does not divide n] * p * F_n(x^p). - Andrei Zabolotskii, Jul 15 2025
FORMULA
EXAMPLE
P(0,x) = 1; P(1,x) = 1 - x; P(2,x) = 1 + x; P(3,x) = 1 + x + x^2; P(4,x) = 1 + x; P(5,x) = 1 + x + x^2 + x^3 + x^4; ...
The irregular triangle a(n,m) begins:
n\m 0 1 2 3 4 5 6 7 8 9 10 11 12 ...
0: 1
1: 1 -1
2: 1 1
3: 1 1 1
4: 1 1
5: 1 1 1 1 1
6: 1 -1 1
7: 1 1 1 1 1 1 1
8: 1 1
9: 1 1 1
10: 1 -1 1 -1 1
11: 1 1 1 1 1 1 1 1 1 1 1
12: 1 -1 1
13: 1 1 1 1 1 1 1 1 1 1 1 1 1
14: 1 -1 1 -1 1 -1 1
15: 1 -1 0 1 -1 1 0 -1 1
16: 1 1
...
MATHEMATICA
nn = 17; f[n_] := DivisorSum[n, MoebiusMu[#] # &]; Flatten[CoefficientList[Table[Denominator[Sum[Sum[f[GCD[n, k]]*x^(n*h + k), {k, 1, n}], {h, 0, Infinity}]], {n, 0, nn}], x]]
CROSSREFS
KEYWORD
tabf,sign
AUTHOR
Mats Granvik, Jul 07 2024
STATUS
approved
