Szekeres's sequence: a(n)-1 in ternary = n-1 in binary; also: a(1) = 1, a(2) = 2, and thereafter a(n) is smallest number k which avoids any 3-term arithmetic progression in a(1), a(2), ..., a(n-1), k.
A003278
Szekeres's sequence: a(n)-1 in ternary = n-1 in binary; also: a(1) = 1, a(2) = 2, and thereafter a(n) is smallest number k which avoids any 3-term arithmetic progression in a(1), a(2), ..., a(n-1), k.
Terms
- a(0) =1a(1) =2a(2) =4a(3) =5a(4) =10a(5) =11a(6) =13a(7) =14a(8) =28a(9) =29a(10) =31a(11) =32a(12) =37a(13) =38a(14) =40a(15) =41a(16) =82a(17) =83a(18) =85a(19) =86a(20) =91a(21) =92a(22) =94a(23) =95a(24) =109a(25) =110a(26) =112a(27) =113a(28) =118a(29) =119
External references
- oeis: A003278