OFFSET
1,1
COMMENTS
Obviously, all divisors of an odd number are isolated.
The numbers of terms that do not exceed 10^k, for k = 1, 2, ..., are 4, 29, 278, 2782, 27813, 278055, 2780548, 27805234, 278052138, 2780519314, ... . Apparently, the asymptotic density of this sequence exists and equals 0.27805... . - Amiram Eldar, Apr 20 2025
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
FORMULA
a(n) = 2*A112886(n). - Ray Chandler, May 29 2008
EXAMPLE
28 is a term of the sequence because its divisors are 1, 2, 4, 7, 14, 28 and only 1 and 2 are non-isolated.
30 does not belong to the sequence because its divisors are 1, 2, 3, 4, 6, 8, 12, 24 and 1, 2, 3, 4 are non-isolated.
MAPLE
with(numtheory): b:=proc(n) local div, ISO, i: div:=divisors(n): ISO:={}: for i to tau(n) do if member(div[i]-1, div)=false and member(div[i]+1, div)=false then ISO:=`union`(ISO, {div[i]}) end if end do end proc: a:=proc(n) if nops(b(n))= tau(n)-2 then n else end if end proc: seq(a(n), n=4..200);
MATHEMATICA
Select[2*Range[120], Min[Differences[Rest[Divisors[#]]]]>1&] (* Harvey P. Dale, Jul 13 2022 *)
PROG
(PARI) isok(k) = if(k%2, 0, if(!(k%3), 0, fordiv(k, d, if(d > 1 && !(k % (d+1)), return(0))); 1)); \\ Amiram Eldar, Apr 20 2025
(Python)
from itertools import count, islice
from sympy import divisors
from sympy.ntheory.primetest import is_square
def A132895_gen(startvalue=2): # generator of terms >= startvalue
return filter(lambda n:all(d==1 or not is_square((d<<3)+1) for d in divisors(n>>1, generator=True)), count(max(startvalue+(startvalue&1), 2), 2))
CROSSREFS
KEYWORD
nonn
AUTHOR
Emeric Deutsch, Oct 16 2007, Oct 19 2007
EXTENSIONS
Corrected and extended by Ray Chandler, May 29 2008
STATUS
approved
