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.

A038901 Primes p such that 29 is a square mod p.

This page as a plain text file.
%I A038901 #18 Jun 25 2014 09:36:50
%S A038901 5,7,13,23,29,53,59,67,71,83,103,107,109,139,149,151,167,173,179,181,
%T A038901 197,199,223,227,233,239,241,257,277,281,283,313,347,349,353,373,383,
%U A038901 397,401,419,431,439,457,463,487,499,509,521,523,547,557,571,587,593,613
%N A038901 Primes p such that 29 is a square mod p.
%C A038901 Also, primes p that are squares mod 29 (from the quadratic reciprocity law). - _Lekraj Beedassy_, Jul 21 2004
%C A038901 Primes which are represented by the indefinite binary quadratic form (1, 7, 5) with discriminant 29 (Lagrange-Gauss reduced (1, 5, -1)). - _Peter Luschny_, Jun 24 2014
%H A038901 Vincenzo Librandi, <a href="/A038901/b038901.txt">Table of n, a(n) for n = 1..1000</a>
%H A038901 N. J. A. Sloane et al., <a href="https://oeis.org/wiki/Binary_Quadratic_Forms_and_OEIS">Binary Quadratic Forms and OEIS</a> (Index to related sequences, programs, references)
%t A038901 Select[Prime[Range[100]], JacobiSymbol[29, #] != -1 &] (* _Vincenzo Librandi_, Sep 07 2012 *)
%Y A038901 Cf. A035264.
%K A038901 nonn
%O A038901 1,1
%A A038901 _N. J. A. Sloane_, Dec 11 1999