cp's OEIS Frontend

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.

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.

Original entry on oeis.org

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

Views

Author

Peter Kagey, Sep 29 2019

Keywords

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.

Examples

			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