|
|
A284376
|
|
a(n) is the least nonnegative integer such that n + i*a(n) is a Gaussian prime.
|
|
1
|
|
|
3, 1, 1, 0, 1, 2, 1, 0, 3, 4, 1, 0, 7, 2, 1, 2, 1, 2, 5, 0, 1, 4, 5, 0, 1, 4, 1, 2, 5, 4, 11, 0, 3, 2, 5, 2, 1, 2, 3, 10, 1, 4, 5, 0, 9, 2, 5, 0, 13, 4, 7, 4, 3, 10, 1, 4, 1, 2, 3, 0, 13, 10, 3, 32, 9, 2, 1, 0, 5, 10, 3, 0, 5, 2, 1, 4, 5, 10, 7, 0, 7, 4, 3, 0, 1, 2, 9, 2, 3, 4, 1, 4, 7, 8, 1, 2, 5, 2, 3, 4, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
LINKS
|
|
|
FORMULA
|
(End)
|
|
MAPLE
|
f:= proc(n) local k;
for k from 0 do if GaussInt:-GIprime(n+I*k) then return k fi od
end proc:
|
|
MATHEMATICA
|
Table[k = 0; While[! PrimeQ[n + I k, GaussianIntegers -> True], k++]; k, {n, 0, 100}] (* Michael De Vlieger, Mar 29 2017 *)
|
|
PROG
|
(ANS-Forth)
s" numbertheory.4th" included
: 3mod4_prime \ n -- flag
abs dup isprime swap 3 and 3 = and ;
: isGaussianPrime \ a b -- flag
over 0= if nip 3mod4_prime exit then
dup 0= if drop 3mod4_prime exit then
dup * swap dup * + isprime ;
: Gauss_prime \ n -- a(n)
0
begin 2dup isGaussianPrime 0=
while 1+
repeat nip ;
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|