[go: up one dir, main page]

login
Revision History for A322083 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = Sum_{d|n} (-1)^(n/d+d)*d^k.
(history; published version)
#22 by OEIS Server at Sun Jan 07 15:52:07 EST 2024
LINKS

Andrew Howroyd, <a href="/A322083/b322083_1.txt">Table of n, a(n) for n = 1..1275</a> (first 50 antidiagonals)

#21 by Michael De Vlieger at Sun Jan 07 15:52:07 EST 2024
STATUS

proposed

approved

Discussion
Sun Jan 07
15:52
OEIS Server: Installed first b-file as b322083.txt.
#20 by Andrew Howroyd at Sun Jan 07 15:19:56 EST 2024
STATUS

editing

proposed

#19 by Andrew Howroyd at Sun Jan 07 15:09:38 EST 2024
LINKS

Andrew Howroyd, <a href="/A322083/b322083_1.txt">Table of n, a(n) for n = 1..1275</a> (first 50 antidiagonals)

STATUS

approved

editing

#18 by N. J. A. Sloane at Tue Nov 22 22:01:21 EST 2022
STATUS

proposed

approved

#17 by Amiram Eldar at Tue Nov 22 15:02:28 EST 2022
STATUS

editing

proposed

#16 by Amiram Eldar at Tue Nov 22 14:55:46 EST 2022
MATHEMATICA

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 *)

STATUS

approved

editing

#15 by Bruno Berselli at Thu Mar 24 10:34:30 EDT 2022
STATUS

proposed

approved

#14 by Michel Marcus at Sun Mar 20 06:45:10 EDT 2022
STATUS

editing

proposed

#13 by Michel Marcus at Sun Mar 20 06:45:06 EDT 2022
LINKS

<a href="/index/Ge#Glaisher">Index entries for sequences mentioned by Glaisher</a>

<a href="/index/Ge#Glaisher">Index entries for sequences mentioned by Glaisher</a>

STATUS

proposed

editing