Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
reviewed
approved
proposed
reviewed
editing
proposed
See A248641 for the "postive positive integers" variant.
proposed
editing
editing
proposed
Least nonnegative sequence which does not contain a 4-term equidistant subsequence (a(n+k*d); k=0,1,2,3) in arithmetic progression.
See A248641 for the "postive integers" variant.
allocated for M. F. Hasler
Least nonnegative sequence which does not contain a 4-term equidistant subsequence (a(n+k*d);k=0,1,2,3) in arithmetic progression.
0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 2, 0, 0, 0, 1, 0, 1, 1, 1, 2, 2, 2, 0, 0, 2, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 2, 2, 1, 2, 1, 2, 2, 4, 0, 0, 0, 2, 0, 0, 2, 0, 0, 0, 1, 1, 1, 2, 0, 1, 0, 0, 0, 1, 1, 1, 2, 3, 1, 2, 1, 1, 1, 2, 2, 0, 2, 2, 2, 4, 4, 3, 0, 0, 0, 2, 0, 1, 2, 0, 4, 2, 1, 5, 0, 2, 1, 1, 2, 1, 0, 0, 2, 2, 0, 0, 0, 3, 0, 0, 1, 1, 1, 4, 1, 2, 3, 0, 1, 2, 1, 0, 3, 3, 4, 1, 1, 3
0,14
See A248625 for more information, links and examples.
(PARI) a=[]; for(n=1, 190, a=concat(a, 0); while(hasAP(a, 4), a[#a]++)); a \\ See A248625 for hasAP().
allocated
nonn
M. F. Hasler, Oct 10 2014
approved
editing
allocated for M. F. Hasler
allocated
approved