A361933 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 an arithmetic progression in any order.
1, 1, 2, 1, 1, 2, 2, 4, 4, 1, 1, 2, 1, 1, 2, 2, 4, 4, 2, 4, 4, 5, 5, 8, 5, 5, 9, 9, 4, 2, 5, 11, 2, 2, 4, 1, 1, 5, 1, 1, 10, 2, 2, 4, 1, 1, 4, 4, 10, 10, 4, 8, 10, 10, 2, 4, 1, 2, 5, 4, 10, 10, 4, 2, 8, 8, 5, 8, 5, 13, 13, 17, 5, 13, 2, 11, 17, 10, 10, 13, 13
Offset: 1
Keywords
Examples
a(28) cannot be 1 because then a(26)=5, a(27)=9, and a(28)=1 could be rearranged to form an arithmetic progression (1, 5, 9). The numbers 2-8 could also create an arithmetic progression so a(28)=9.
Links
- Rémy Sigrist, Table of n, a(n) for n = 1..10000
- Rémy Sigrist, PARI program
- Index entries for non-averaging sequences
- Neal Gersh Tolunsky, Graph of the first 200000 terms
Programs
-
PARI
\\ See Links section.
Formula
a(n) <= (n+1)/2.
Comments