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 A347066 #10 Sep 03 2021 05:56:43
%S A347066 1,3,1,5,3,1,6,6,3,1,8,7,7,3,1,10,10,8,7,3,1,11,12,11,8,7,3,1,13,14,
%T A347066 14,12,8,7,3,1,15,16,16,15,12,8,7,3,1,17,19,18,17,16,12,8,7,3,1,18,21,
%U A347066 21,19,18,16,12,8,7,3,1,20,23,23,23,20,18,16,12,8
%N A347066 Rectangular array (T(n,k)), by antidiagonals: T(n,k) is the position of k in the ordering of {h/r^m, r = sqrt(2), h >= 1, 0 <= m <= n}.
%e A347066 Corner:
%e A347066 1, 3, 5, 6, 8, 10, 11, 13, 15, 17, 18, 20, ...
%e A347066 1, 3, 6, 7, 10, 12, 14, 16, 19, 21, 23, 25, ...
%e A347066 1, 3, 7, 8, 11, 14, 16, 18, 21, 23, 25, 28, ...
%e A347066 1, 3, 7, 8, 12, 15, 17, 19, 23, 25, 27, 30, ...
%e A347066 1, 3, 7, 8, 12, 16, 18, 20, 24, 26, 28, 32, ...
%e A347066 1, 3, 7, 8, 12, 16, 18, 20, 24, 26, 28, 32, ...
%e A347066 1, 3, 7, 8, 12, 16, 18, 20, 24, 26, 28, 32, ...
%e A347066 ...
%t A347066 z = 100; r = N[Sqrt[2]];
%t A347066 s[m_] := Range[z] r^m; t[0] = s[0];
%t A347066 t[n_] := Sort[Union[s[n], t[n - 1]]]
%t A347066 row[n_] := Flatten[Table[Position[t[n], N[k]], {k, 1, z}]]
%t A347066 TableForm[Table[row[n], {n, 1, 10}]] (* A347066, array *)
%t A347066 w[n_, k_] := row[n][[k]];
%t A347066 Table[w[n - k + 1, k], {n, 12}, {k, n, 1, -1}] // Flatten (* A347066, sequence *)
%Y A347066 Cf. A003152 (row 1), A347065, A347067, A347068, A347069.
%K A347066 nonn,tabl
%O A347066 1,2
%A A347066 _Clark Kimberling_, Sep 02 2021