This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A308502 #19 May 11 2021 01:55:06 %S A308502 1,1,3,1,5,4,1,9,10,9,1,17,28,25,6,1,33,82,81,26,24,1,65,244,289,126, %T A308502 80,8,1,129,730,1089,626,330,50,41,1,257,2188,4225,3126,1604,344,161, %U A308502 37,1,513,6562,16641,15626,8634,2402,833,163,68,1,1025,19684,66049,78126,49100,16808,5249,973,290,12 %N A308502 Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = Sum_{d|n} d^(n/d + k). %H A308502 Seiichi Manyama, <a href="/A308502/b308502.txt">Antidiagonals n = 1..140, flattened</a> %F A308502 L.g.f. of column k: -log(Product_{j>=1} (1 - j*x^j)^(j^(k-1))). %e A308502 Square array begins: %e A308502 1, 1, 1, 1, 1, 1, ... %e A308502 3, 5, 9, 17, 33, 65, ... %e A308502 4, 10, 28, 82, 244, 730, ... %e A308502 9, 25, 81, 289, 1089, 4225, ... %e A308502 6, 26, 126, 626, 3126, 15626, ... %e A308502 24, 80, 330, 1604, 8634, 49100, ... %t A308502 T[n_, k_] := DivisorSum[n, #^(n/# + k) &]; Table[T[k, n - k], {n, 1, 11}, {k, 1, n}] // Flatten (* _Amiram Eldar_, May 11 2021 *) %Y A308502 Columns k=0..2 give A055225, A078308, A296601. %Y A308502 Cf. A279394, A308504. %K A308502 nonn,tabl %O A308502 1,3 %A A308502 _Seiichi Manyama_, Jun 02 2019