OFFSET
1,2
COMMENTS
a(1) = 1, a(n) = least number such that every difference a(i)-a(j) is a distinct even number. - Amarnath Murthy, Apr 07 2004
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..1000
FORMULA
a(n) = 2*A005282(n)-1. (David Wasserman)
EXAMPLE
5 is not in the sequence since 5+1 is already obtainable from 3+3, 9 is excluded since 1, 3 and 7 are in the sequence and would collide with 1+9
MATHEMATICA
seq2={1, 3}; Do[le=Length[seq2]; t=Last[seq2]+2; While[Length[Expand[(Plus @@ (x^seq2) + x^t)^2]] < Pochhammer[3, le]/le!, t=t+2]; AppendTo[seq2, t], {20}]; Print@seq2
PROG
(Haskell)
a034757 = (subtract 1) . (* 2) . a005282 -- Reinhard Zumkeller, Dec 18 2012
(Python)
from itertools import count, islice
def A034757_gen(): # generator of terms
aset1, aset2, alist = set(), set(), []
for k in count(1, 2):
bset2 = {k<<1}
if (k<<1) not in aset2:
for d in aset1:
if (m:=d+k) in aset2:
break
bset2.add(m)
else:
yield k
alist.append(k)
aset1.add(k)
aset2.update(bset2)
CROSSREFS
KEYWORD
nonn,nice,easy
AUTHOR
Wouter Meeussen, Jun 01 2000
EXTENSIONS
An incorrect comment from Amarnath Murthy, also dated Apr 07 2004, has been deleted.
Offset fixed by Reinhard Zumkeller, Dec 18 2012
STATUS
approved