A373052 Lexicographically earliest sequence of positive integers such that no three terms a(j), a(j+k), a(j+2k) (for any j and k) form a weakly decreasing arithmetic progression.

1, 1, 2, 1, 1, 2, 2, 3, 3, 1, 1, 2, 1, 1, 2, 2, 3, 3, 2, 3, 3, 4, 4, 5, 4, 4, 5, 1, 3, 2, 4, 1, 1, 2, 1, 3, 2, 4, 2, 5, 1, 2, 2, 1, 3, 3, 4, 3, 4, 5, 2, 4, 3, 5, 5, 6, 3, 4, 3, 6, 4, 4, 5, 5, 4, 5, 5, 6, 6, 7, 6, 6, 7, 7, 5, 8, 6, 8, 6, 7, 7, 2, 7, 7, 2, 8

Offset

1,3

Links

Neal Gersh Tolunsky, Table of n, a(n) for n = 1..10000

Rémy Sigrist, PARI program.

Neal Gersh Tolunsky, Graph of first 400000 terms.

Prog

(PARI) \\ See Links section.

Crossrefs

Cf. A229037, A309890, A100480, A373010, A361933, A371632, A373111, A371457.

Sequence in context: A029261 A359384 A100480 * A268811 A371457 A373010

Adjacent sequences: A373049 A373050 A373051 * A373053 A373054 A373055

Keyword

nonn,look

Author

Neal Gersh Tolunsky, May 20 2024

Status

approved