OFFSET
1,1
LINKS
R. J. Mathar, Table of n, a(n) for n = 1..1185
MAPLE
isA046099 := proc(n)
local p;
for p in ifactors(n)[2] do
if op(2, p) >= 3 then
return true;
end if;
end do:
false ;
end proc:
n := 1;
for i from 1 to 5000 do
if isA046099(i^3-1) then
printf("%d %d\n", n, i) ;
n := n+1;
end if;
end do: # R. J. Mathar, Dec 03 2015
MATHEMATICA
n3dcQ[n_]:=Count[Divisors[n^3-1]], _?(IntegerQ[Surd[#, 3]]&)>1; Select[ Range[ 2, 250], n3dcQ] (* Harvey P. Dale, Oct 05 2017 *)
PROG
(Python)
from sympy import factorint
def ok(n): return max(factorint(n**3 - 1).values()) >= 3
print(list(filter(ok, range(1, 250)))) # Michael S. Branicky, Sep 10 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Sep 19 2003
EXTENSIONS
Corrected and extended by Ray Chandler, Sep 23 2003
Definition clarified by Harvey P. Dale, Oct 05 2017
STATUS
approved