This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A020656 #32 Jan 09 2016 12:01:33 %S A020656 0,1,2,3,4,6,7,8,9,11,12,13,14,16,17,18,19,21,22,23,24,25,32,33,34,35, %T A020656 36,38,42,43,44,45,46,48,49,50,51,58,59,61,62,63,64,65,67,68,70,72,76, %U A020656 84,86,87,88,89,90,92,95,96,97,98,99,102,103,106,110,113,114,116,117,119,121 %N A020656 Lexicographically earliest increasing sequence of nonnegative numbers that contains no arithmetic progression of length 6. %H A020656 David W. Wilson, <a href="/A020656/b020656.txt">Table of n, a(n) for n = 1..10000</a> %F A020656 a(n) = A005838(n) - 1. %e A020656 5 is excluded since (0,1,2,3,4,5) would be a 6-term AP. %e A020656 10 is excluded since (0,2,4,6,8,10) would be a 6-term AP. %e A020656 Idem for 15 and 20. %e A020656 25 is not excluded, but after 25 (1,6,11,16,21,26) would be a 6-AP, and similarly all of 26 through 32 are excluded. %o A020656 (PARI) A020656(n,show=1,i=0,o=6,u=0)={for(n=1,n,show&&print1(i,",");u+=1<<i;while(i++,for(s=1,i\(o-1),for(j=1,o-1,bittest(u,i-s*j)||next(2));next(2));next(2)));i} \\ _M. F. Hasler_, Jan 03 2016 %Y A020656 Summary of increasing sequences avoiding arithmetic progressions of specified lengths (the second of each pair is obtained by adding 1 to the first): %Y A020656 3-term AP: A005836 (>=0), A003278 (>0); %Y A020656 4-term AP: A005839 (>=0), A005837 (>0); %Y A020656 5-term AP: A020654 (>=0), A020655 (>0); %Y A020656 6-term AP: A020656 (>=0), A005838 (>0); %Y A020656 7-term AP: A020657 (>=0), A020658 (>0); %Y A020656 8-term AP: A020659 (>=0), A020660 (>0); %Y A020656 9-term AP: A020661 (>=0), A020662 (>0); %Y A020656 10-term AP: A020663 (>=0), A020664 (>0). %K A020656 nonn %O A020656 1,3 %A A020656 _David W. Wilson_ %E A020656 Edited by _M. F. Hasler_, Jan 03 2016 %E A020656 Further edited (with new offset) by _N. J. A. Sloane_, Jan 04 2016