cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A282726 Let p = n-th prime == 3 mod 8; a(n) = sum of quadratic nonresidues mod p .

Original entry on oeis.org

2, 33, 95, 473, 944, 1139, 1826, 2996, 4585, 5004, 6683, 8413, 11394, 13393, 16566, 20376, 23946, 27804, 30883, 36384, 45671, 50059, 56040, 62357, 62874, 69559, 75486, 81635, 82795, 88050, 97183, 104166, 112030, 118159, 120925, 138193, 156613, 167066, 173670, 187262, 196026, 206796, 226333, 242750
Offset: 1

Views

Author

N. J. A. Sloane, Feb 20 2017

Keywords

Crossrefs

Programs

  • Maple
    with(numtheory):
    Ql:=[]; Qu:=[]; Q:=[]; Nl:=[]; Nu:=[]; N:=[]; Th:=[];
    for i1 from 1 to 300 do
    p:=ithprime(i1);
    if (p mod 8) = 3 then
    ql:=0; qu:=0; q:=0; nl:=0; nu:=0; n:=0;
    for j from 1 to p-1 do
    if legendre(j,p)=1 then
    q:=q+j;
    if j
  • Mathematica
    Table[Table[Mod[a^2, p/2], {a, 1, (p-1)}]//Total, {p, Select[Prime[ Range[ 200]], Mod[#, 8] == 3 &]}] (* Vincenzo Librandi, Feb 22 2017 *)