login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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.
1
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, 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, 13, 9, 1, 2, 4, 3, 6, 11, 5, 9, 7, 13, 10, 16, 1, 2, 4, 3
OFFSET
1,3
COMMENTS
First row is A175498. Main diagonal is A327743.
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, ...
For example, T(6, 194) != A327743(194), but T(6, n) = A327743(n) for n < 194.
LINKS
Peter Kagey, Table of n, a(n) for n = 1..10011 (first 141 antidiagonals, flattened)
EXAMPLE
Table begins:
1, 2, 4, 3, 6, 10, 5, 11, 7, 12, 9, 16, 8, 17, 15, 23, ...
1, 2, 4, 3, 6, 11, 5, 9, 7, 13, 10, 18, 8, 15, 25, 12, ...
1, 2, 4, 3, 6, 11, 5, 9, 7, 13, 10, 18, 8, 15, 25, 12, ...
1, 2, 4, 3, 6, 11, 5, 9, 7, 13, 10, 18, 8, 15, 27, 12, ...
1, 2, 4, 3, 6, 11, 5, 9, 7, 13, 10, 18, 8, 15, 27, 12, ...
1, 2, 4, 3, 6, 11, 5, 9, 7, 13, 10, 18, 8, 15, 27, 14, ...
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Peter Kagey, Sep 29 2019
STATUS
approved