A322083 Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = Sum_{d|n} (-1)^(n/d+d)*d^k.
1, 1, -2, 1, -3, 2, 1, -5, 4, -1, 1, -9, 10, -3, 2, 1, -17, 28, -13, 6, -4, 1, -33, 82, -57, 26, -12, 2, 1, -65, 244, -241, 126, -50, 8, 0, 1, -129, 730, -993, 626, -252, 50, -3, 3, 1, -257, 2188, -4033, 3126, -1394, 344, -45, 13, -4, 1, -513, 6562, -16257, 15626, -8052, 2402, -441, 91, -18, 2
Offset: 1
Examples
Square array begins: 1, 1, 1, 1, 1, 1, ... -2, -3, -5, -9, -17, -33, ... 2, 4, 10, 28, 82, 244, ... -1, -3, -13, -57, -241, -993, ... 2, 6, 26, 126, 626, 3126, ... -4, -12, -50, -252, -1394, -8052, ...
Links
- Andrew Howroyd, Table of n, a(n) for n = 1..1275 (first 50 antidiagonals)
- Peter Bala, A signed Dirichlet product of arithmetical functions
- Index entries for sequences mentioned by Glaisher
Crossrefs
Programs
-
Mathematica
Table[Function[k, Sum[(-1)^(n/d+d) d^k, {d, Divisors[n]}]][i - n], {i, 0, 11}, {n, 1, i}] // Flatten Table[Function[k, SeriesCoefficient[Sum[(-1)^(j + 1) j^k x^j/(1 + x^j), {j, 1, n}], {x, 0, n}]][i - n], {i, 0, 11}, {n, 1, i}] // Flatten f[p_, e_, k_] := If[k == 0, e + 1, (p^(k*e + k) - 1)/(p^k - 1)]; f[2, e_, k_] := If[k == 0, e - 3, -((2^(k - 1) - 1)*2^(k*e + 1) + 2^(k + 1) - 1)/(2^k - 1)]; T[1, k_] = 1; T[n_, k_] := Times @@ (f[First[#], Last[#], k] & /@ FactorInteger[n]); Table[T[n - k, k], {n, 1, 11}, {k, n - 1, 0, -1}] // Flatten (* Amiram Eldar, Nov 22 2022 *)
-
PARI
T(n,k)={sumdiv(n, d, (-1)^(n/d+d)*d^k)} for(n=1, 10, for(k=0, 8, print1(T(n, k), ", ")); print); \\ Andrew Howroyd, Nov 26 2018
Formula
G.f. of column k: Sum_{j>=1} (-1)^(j+1)*j^k*x^j/(1 + x^j).
Comments