Let s(k) denote the k-th term of an integer sequence such that s(0)=0 and s(i) for all i>0 is the least natural number such that no four elements of {s(0),..,s(i)} are in arithmetic progression. Then it appears that there are many set of 3 consecutive integers in s(k). Sequence gives the smallest element in those triples.
A071711
Let s(k) denote the k-th term of an integer sequence such that s(0)=0 and s(i) for all i>0 is the least natural number such that no four elements of {s(0),..,s(i)} are in arithmetic progression. Then it appears that there are many set of 3 consecutive integers in s(k). Sequence gives the smallest element in those triples.
Terms
- a(0) =0a(1) =7a(2) =14a(3) =28a(4) =48a(5) =55a(6) =64a(7) =86a(8) =108a(9) =168a(10) =286a(11) =371a(12) =471a(13) =633a(14) =760a(15) =982a(16) =1032a(17) =1136a(18) =1261a(19) =1600a(20) =1739a(21) =1788a(22) =1822a(23) =1848a(24) =3832a(25) =4225a(26) =5504a(27) =7729a(28) =8062a(29) =9229
External references
- oeis: A071711