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.

A038876 Primes p such that 6 is a square mod p.

This page as a plain text file.
%I A038876 #12 Jul 08 2025 22:25:42
%S A038876 2,3,5,19,23,29,43,47,53,67,71,73,97,101,139,149,163,167,173,191,193,
%T A038876 197,211,239,241,263,269,283,293,307,311,313,317,331,337,359,379,383,
%U A038876 389,409,431,433,457,461,479,499,503,509,523,547,557,571,577,599,601,619,643,647
%N A038876 Primes p such that 6 is a square mod p.
%C A038876 Also: for p>6, primes of the form 24*k +/-1 or +-5. - _Zak Seidov_ Feb 01 2008.
%H A038876 Vincenzo Librandi, <a href="/A038876/b038876.txt">Table of n, a(n) for n = 1..1000</a>
%p A038876 with(numtheory); t1:=[]; for n from 1 to 500 do p:=ithprime(n); if quadres(6,p) = 1 then t1:=[op(t1),p]; fi; od: t1;
%t A038876 Select[Prime[Range[3000]],JacobiSymbol[6,#]!=-1&] (* _Vincenzo Librandi_, Jul 13 2012 *)
%K A038876 nonn
%O A038876 1,1
%A A038876 _N. J. A. Sloane_