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.

A025046 a(n) = the least odd prime p such that there are exactly n consecutive quadratic remainders modulo p.

This page as a plain text file.
%I A025046 #8 Oct 19 2017 03:13:45
%S A025046 3,5,19,17,67,71,131,73,277,311,827,241,1607,2543,3691,1559,6803,5711,
%T A025046 14969,1009,43103,10559,52057,2689,90313,162263,127403,18191,209327,
%U A025046 31391,607153,8089,1305511,298483,1694353,33049,3205777,1523707
%N A025046 a(n) = the least odd prime p such that there are exactly n consecutive quadratic remainders modulo p.
%C A025046 The values -1,0,+1 are considered consecutive.
%e A025046 a(5)=17 because -2,-1,0,+1,+2 are quadratic remainders, squares of 7,4,0,1,11.
%Y A025046 Cf. A097159.
%K A025046 nonn
%O A025046 2,1
%A A025046 _David W. Wilson_
%E A025046 Edited by _Don Reble_, May 31 2007