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
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.
Programs
-
PARI
\\ See Links section.