|
|
A020664
|
|
Lexicographically earliest increasing sequence of positive numbers that contains no arithmetic progression of length 10.
|
|
29
|
|
|
1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 20, 21, 22, 23, 24, 25, 26, 27, 28, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 49, 50, 51, 52, 53, 54, 55, 58, 59, 60, 61, 62, 63, 64, 65, 66, 68, 69, 70, 71, 72, 73, 74, 75, 77, 78, 81, 82, 83, 84, 85, 88, 89, 96, 97
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
MAPLE
|
Noap:= proc(N, m)
# N terms of earliest increasing seq with no m-term arithmetic progression
local A, forbid, n, c, ds, j;
A:= Vector(N):
A[1..m-1]:= <($1..m-1)>:
forbid:= {m}:
for n from m to N do
c:= min({$A[n-1]+1..max(max(forbid)+1, A[n-1]+1)} minus forbid);
A[n]:= c;
ds:= convert(map(t -> c-t, A[m-2..n-1]), set);
for j from m-2 to 2 by -1 do
ds:= ds intersect convert(map(t -> (c-t)/j, A[m-j-1..n-j]), set);
if ds = {} then break fi;
od;
forbid:= select(`>`, forbid, c) union map(`+`, ds, c);
od:
convert(A, list)
end proc:
|
|
CROSSREFS
|
Summary of increasing sequences avoiding arithmetic progressions of specified lengths (the second of each pair is obtained by adding 1 to the first):
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|