OFFSET
1,1
COMMENTS
The numbers are of the form p(p+d)(p+(p^2+1)/d), where d runs over divisors of p^2+1 and p runs over all positive integers. See also A147807..A147810. - M. F. Hasler, Jan 07 2009
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
Project Euler, Problem 221: Alexandrian integers
EXAMPLE
630 is an Alexandrian integer since 630 = 5(-7)(-18) and 1/630 = 1/5 - 1/7 - 1/18.
MAPLE
N:= 10^5: # to get all terms <= N
A:= select(`<=`, {seq(seq(p*(p+d)*(p+(p^2+1)/d), d=numtheory:-divisors(p^2+1)), p=1..floor(N^(1/3)))}, N):
sort(convert(A, list)); # Robert Israel, Dec 16 2018
PROG
(PARI) is_A147811(n) = { my(d=divisors(n), c=#d+1); n<42 && return(n==6); for( i=2, c-3, d[i+1]^2>d[c-i] && return; d[c-i]%d[i]==1 | next; for( j=i+1, c-i, d[j]^2>d[c-i] && next(2); d[c-i]\d[j]*(d[j]-d[i]) == d[j]*d[i]+1 && return(1))) }
CROSSREFS
KEYWORD
nonn
AUTHOR
M. F. Hasler and Alexis Olson (AlexisOlson(AT)gmail.com), Dec 13 2008
STATUS
approved