OFFSET
1,1
COMMENTS
Prime numbers of this sequence are congruent to {2,3} modulo 5.
EXAMPLE
The only solution of the equation x^2 + y^2 + 3*x*y = 0 in Z/2Z is (0,0).
4 is not in the sequence because 0^2 + 2^2 + 3*2*0 = 4 == 0 (mod 4). 5 is not in the sequence because 1^2 + 1^2 + 3*1*1 = 5 == 0 (mod 5). 10 is not in the sequence because 2^2 + 2^2 + 3*2*2 = 20 == 0 (mod 10). - R. J. Mathar, Jun 16 2019
MAPLE
isA167415 := proc(n)
local x, y ;
for x from 0 to n-1 do
for y from x to n-1 do
if modp(x^2+y^2+3*x*y, n) = 0 and (x <> 0 or y <> 0) then
return false;
end if;
end do:
end do:
true ;
end proc:
for n from 2 to 300 do
if isA167415(n) then
printf("%d, ", n) ;
end if;
end do: # R. J. Mathar, Jun 16 2019
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Arnaud Vernier, Nov 03 2009
EXTENSIONS
Name corrected by R. J. Mathar, Jun 16 2019 and Don Reble
STATUS
approved