OFFSET
1,2
COMMENTS
Conjecture: Complement of A072389.
LINKS
Michel Marcus, Table of n, a(n) for n = 1..10000
MATHEMATICA
S[n_]:=Divisors[n]+n/Divisors[n]//Union; Test[n_]:= {aux=S[n]; Union[ {False}, Table[aux[[i+1]]-aux[[i]] ==1, {i, Length[aux]-1}]]}[[1]] //Last; Select[Range[1000], Test[#]&]
PROG
(PARI) isok(m) = my(list=List()); fordiv(m, d, listput(list, d+m/d)); my(w = Set(vector(#list-1, k, list[k+1]-list[k]))); #select(x->(x==1), w) == 0; \\ Michel Marcus, Jun 09 2022
(Python)
from sympy import divisors
def ok(n):
s = sorted(set(d + n//d for d in divisors(n)))
return 1 not in set(s[i+1]-s[i] for i in range(len(s)-1))
print([k for k in range(1, 75) if ok(k)]) # Michael S. Branicky, Jul 10 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
José María Grau Ribas, Jun 08 2022
STATUS
approved