OFFSET
1,2
COMMENTS
A triple consists of three distinct values in a(1), a(2), ..., a(n).
By definition, no arithmetic progression of length > 3 can occur in the sequence.
What is the density of this sequence?
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..10000
EXAMPLE
4 is not a term in the sequence because it would create the arithmetic progression (2,3,4), which has the same common difference (1) as the previously occurring triple (1,2,3).
9 is not a term because it would create the arithmetic progression (3,6,9), which has the same common difference (3) as the previously occurring (2,5,8).
PROG
(Python)
from itertools import islice
def cd(k, alst, dset, diff_dict):
newdset = set()
for a in alst:
if k-a in diff_dict[a]:
if k-a in dset:
return False
else:
newdset.add(k-a)
return True, newdset
def agen(): # generator of terms
alst, dset, an = [1, 2, 3], {1}, 3
yield from alst
diff_dict = {1: set(), 2: {1}, 3: {1, 2}}
while True:
k = an+1
while not (ans:=cd(k, alst, dset, diff_dict)): k += 1
dset.update(ans[1])
an = k
diff_dict[k] = {an-a for a in alst}
alst.append(an)
yield an
print(list(islice(agen(), 60))) # Michael S. Branicky, Mar 30 2024
CROSSREFS
KEYWORD
nonn
AUTHOR
Neal Gersh Tolunsky, Mar 25 2024
EXTENSIONS
a(15) and beyond from Michael S. Branicky, Mar 30 2024
STATUS
approved