login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A134653 Number of gaussian primes a+b*i in the first quadrant (a>0,b>=0) such that n<norm<=1+n. 0

%I

%S 0,1,3,2,2,2,5,4,2,4,7,2,4,6,2,8,8,8,7,6,8,6,5,6,10,8,6,10,8,8,9,10,8,

%T 12,10,10,8,10,8,6,14,14,7,14,10,12,11,16,16,10,8,16,18,12,10,14,14,

%U 12,17,14,16

%N Number of gaussian primes a+b*i in the first quadrant (a>0,b>=0) such that n<norm<=1+n.

%C This sequence is different from A055026, which counts the primes according to the exact value of their norm. The present one gives an idea of the variation of the density of gaussian primes.

%e Examples, written as (a,b) = norm(2 decimal digits):

%e n=0: No prime of norm <1, so a(0) =0

%e (1,1) = 1,41) hence a(1) =1

%e (1,2) and (2,1) = 2,23 (0,3) = 3 hence a(2)=3

%e (1,4) and (4,1) = 4,12 hence a(3)=2

%Y Cf. A055026.

%K easy,nonn

%O 1,3

%A Philippe Lallouet (philip.lallouet(AT)orange.fr), Jan 31 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 21 13:55 EST 2020. Contains 331113 sequences. (Running on oeis4.)