|
|
A240075
|
|
Lexicographically earliest nonnegative increasing sequence such that no four terms have constant second differences.
|
|
12
|
|
|
0, 1, 2, 4, 5, 8, 15, 16, 17, 20, 44, 51, 52, 53, 56, 58, 64, 78, 166, 167, 192, 195, 196, 200, 202, 203, 206, 217, 226, 248, 249, 276, 312, 649, 657, 678, 681, 682, 715, 726, 740, 743, 747, 750, 771, 790, 830, 833, 836, 838, 842, 854, 875, 908, 911, 971
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
MATHEMATICA
|
t = {0, 1, 2}; Do[s = Table[Append[i, n], {i, Subsets[t, {3}]}]; If[! MemberQ[Flatten[Table[Differences[i, 3], {i, s}]], 0], AppendTo[t, n]], {n, 3, 1000}]; t
|
|
PROG
|
(PARI) A240075(n, show=0, L=4, o=2, v=[0], D=v->v[2..-1]-v[1..-2])={ my(d, m); while( #v<n, show&&print1(v[#v]", "); v=concat(v, v[#v]); while( v[#v]++, forvec( i=vector(L, j, [if(j<L, j, #v), #v]), d=D(vecextract(v, i)); m=o; while(m--&&#Set(d=D(d))>1, ); #Set(d)>1||next(2), 2); break)); v[#v]} \\ M. F. Hasler, Jan 12 2016
|
|
CROSSREFS
|
For the positive sequence, see A240555, which is this sequence plus 1.
Summary of increasing sequences avoiding arithmetic progressions of specified lengths (the second of each pair is obtained by adding 1 to the first):
For the analog sequence which avoids 5-term subsequences of constant third differences, see A240556 (>=0) and A240557 (>0).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|