This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A178151 The number of quadratic residues (mod p) less than p/2, where p=prime(n). 3

%I

%S 1,1,2,4,3,4,6,7,7,9,9,10,12,14,13,19,15,18,21,18,22,25,22,24,25,28,

%T 31,27,28,34,40,34,39,37,41,39,42,47,43,52,45,54,48,49,54,57,59,64,57,

%U 58,67,60,73,64,72,67,73,69,70,75,73,81,87,78,79,87,84,94,87,88,99,96,93

%N The number of quadratic residues (mod p) less than p/2, where p=prime(n).

%C Sequence A063987 lists the quadratic residues (mod p) for each prime p. When p=1 (mod 4), there are an equal number of quadratic residues less than p/2 and greater than p/2. When p=3 (mod 4), there are always more quadratic residues less than p/2 than greater than p/2.

%H R. J. Mathar, <a href="/A178151/b178151.txt">Table of n, a(n) for n = 2..3132</a>

%H MathOverflow, <a href="http://mathoverflow.net/questions/25263">Most squares in the first half-interval</a>

%e The quadratic residues of 19, the 8th prime, are 1, 4, 5, 6, 7, 9, 11, 16, 17. Six of these are less than 19/2. Hence a(8)=6.

%p A178151 := proc(n)

%p local r,a,p;

%p p := ithprime(n) ;

%p a := 0 ;

%p for r from 1 to p/2 do

%p if numtheory[legendre](r,p) =1 then

%p a := a+1 ;

%p end if;

%p end do:

%p a;

%p end proc: # _R. J. Mathar_, Feb 10 2017

%t Table[p=Prime[n]; Length[Select[Range[(p-1)/2], JacobiSymbol[ #,p]==1&]], {n,2,100}]

%Y Cf. A178152, A178153, A178154

%K nonn

%O 2,3

%A _T. D. Noe_, May 21 2010

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.

Last modified May 23 13:25 EDT 2019. Contains 323514 sequences. (Running on oeis4.)