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 A182831 #20 Oct 15 2024 23:17:07
%S A182831 1,2,3,4,6,8,5,11,17,22,7,14,28,45,55,9,19,37,70,112,137,10,23,48,93,
%T A182831 171,276,334,12,26,57,118,228,417,671,812,13,31,66,141,287,556,1010,
%U A182831 1627,1965,15,34,77,164,344,697,1347,2444,3934,4751,16,39
%N A182831 Joint-rank array of numbers j*r^(i-1), where r=1+sqrt(2), read by antidiagonals.
%C A182831 Joint-rank arrays are defined in the first comment at A182801. (row 1)=A087063. First 3 columns are A020062, A020063, A020064.
%C A182831 Every positive integer occurs exactly once, so that as a sequence, this is a permutation of the positive integers.
%H A182831 G. C. Greubel, <a href="/A182831/b182831.txt">Rows n=1..100 of triangle, flattened</a>
%F A182831 T(i,j) = Sum_{n>=1} floor(j*(1+sqrt(2))^(i-n)).
%e A182831 Northwest corner:
%e A182831 1 2 4 5 ...
%e A182831 3 6 11 14 ...
%e A182831 8 17 28 37 ...
%e A182831 22 45 70 93 ...
%e A182831 ...
%t A182831 T[n_, k_] := Sum[Floor[k*(1 + Sqrt[2])^(n - j)], {j, 1, 100}]; Table[T[k + 1, n - k], {n,1,10}, {k, 0, n-1}]//Flatten (* _G. C. Greubel_, Aug 18 2018 *)
%Y A182831 Cf. A182801.
%K A182831 nonn,tabl
%O A182831 1,2
%A A182831 _Clark Kimberling_, Dec 07 2010