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 A327844 #9 Sep 30 2019 21:57:56 %S A327844 1,1,2,1,2,4,1,2,4,3,1,2,4,3,6,1,2,4,3,6,10,1,2,4,3,6,11,5,1,2,4,3,6, %T A327844 11,5,11,1,2,4,3,6,11,5,9,7,1,2,4,3,6,11,5,9,7,12,1,2,4,3,6,11,5,9,7, %U A327844 13,9,1,2,4,3,6,11,5,9,7,13,10,16,1,2,4,3 %N A327844 Table read by antidiagonals: the m-th row gives the sequence constructed by repeatedly choosing the smallest positive number not already in the row such that for each k = 1, ..., m, the k-th differences are distinct. %C A327844 First row is A175498. Main diagonal is A327743. %C A327844 The index of where the m-th row first differs from A327743 is 6, 15, 15, 16, 16, 194, 301, 301, 1036, 1036, 1036, 1037, ... %C A327844 For example, T(6, 194) != A327743(194), but T(6, n) = A327743(n) for n < 194. %H A327844 Peter Kagey, <a href="/A327844/b327844.txt">Table of n, a(n) for n = 1..10011</a> (first 141 antidiagonals, flattened) %e A327844 Table begins: %e A327844 1, 2, 4, 3, 6, 10, 5, 11, 7, 12, 9, 16, 8, 17, 15, 23, ... %e A327844 1, 2, 4, 3, 6, 11, 5, 9, 7, 13, 10, 18, 8, 15, 25, 12, ... %e A327844 1, 2, 4, 3, 6, 11, 5, 9, 7, 13, 10, 18, 8, 15, 25, 12, ... %e A327844 1, 2, 4, 3, 6, 11, 5, 9, 7, 13, 10, 18, 8, 15, 27, 12, ... %e A327844 1, 2, 4, 3, 6, 11, 5, 9, 7, 13, 10, 18, 8, 15, 27, 12, ... %e A327844 1, 2, 4, 3, 6, 11, 5, 9, 7, 13, 10, 18, 8, 15, 27, 14, ... %Y A327844 Cf. A175498, A327743, A327845. %K A327844 nonn,tabl %O A327844 1,3 %A A327844 _Peter Kagey_, Sep 29 2019