login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; table; graph; refs; listen; history; text; internal format)
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
Sequence in context: A253572 A141539 A340547 * A243851 A168266 A059250
KEYWORD
nonn,tabl
AUTHOR
Peter Kagey, Sep 29 2019
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 14:15 EDT 2024. Contains 371914 sequences. (Running on oeis4.)