OFFSET
1,1
COMMENTS
Conjecture: a(n) > 0 for all n.
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
Rémy Sigrist, Logarithmic scatterplot of the first 100000 terms
EXAMPLE
MAPLE
N:= 10^4: # to use A005132(n) for n = 1..N
S:= {0}:
A5132:= Array(0..N):
A5132[0]:= 0:
for n from 1 to N do
v:= A5132[n-1]-n;
if v < 0 or member(v, S) then v:= A5132[n-1]+n fi;
A5132[n]:= v;
S:= S union {v};
od:
f:= proc(n) local k;
for k from 1 to N do
if k <> n and A5132[k] mod A5132[n] = 0 then return k fi
od:
0
end proc:
Res:= NULL:
for n from 1 do
v:= f(n);
if v = 0 then break fi;
Res:= Res, v;
od:
Res; # Robert Israel, Oct 10 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Altug Alkan, Oct 10 2017
STATUS
approved