login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A080089
Let r+i*s be the sum of the first-quadrant Gaussian primes dividing prime(n); sequence gives s values.
4
2, 0, 3, 0, 0, 5, 5, 0, 0, 7, 0, 7, 9, 0, 0, 9, 0, 11, 0, 0, 11, 0, 0, 13, 13, 11, 0, 0, 13, 15, 0, 0, 15, 0, 17, 0, 17, 0, 0, 15, 0, 19, 0, 19, 15, 0, 0, 0, 0, 17, 21, 0, 19, 0, 17, 0, 23, 0, 23, 21, 0, 19, 0, 0, 25, 25, 0, 25, 0, 23, 25, 0, 0, 25, 0, 0, 27, 25, 21, 23, 0, 29, 0, 29, 0, 0, 27, 25
OFFSET
1,1
LINKS
MATHEMATICA
s[n_] := Module[{f = FactorInteger[n, GaussianIntegers->True]}, p = f[[;; , 1]]; e = f[[;; , 2]]; Im[Plus @@ ((If[Abs[#]==1, 0, #]& /@ p) * e)]]; s /@ Select[ Range[100], PrimeQ] (* Amiram Eldar, Feb 28 2020 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Vladeta Jovovic, Jan 27 2003
STATUS
approved