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.

A106930 Primes of the form x^2 - xy + 16y^2, with x and y nonnegative.

This page as a plain text file.
%I A106930 #21 Aug 05 2014 14:16:29
%S A106930 67,79,127,163,277,373,421,463,541,547,571,613,631,739,823,877,967,
%T A106930 1009,1033,1051,1087,1093,1129,1213,1297,1579,1621,1663,1723,1831,
%U A106930 1933,1999,2011,2179,2251,2269,2293,2377,2389,2437,2503,2557,2683,2689,2731,2767
%N A106930 Primes of the form x^2 - xy + 16y^2, with x and y nonnegative.
%C A106930 Discriminant = -63.
%C A106930 This appears to coincide with the sequence of primes of the form x^2 + 63y^2. - _Artur Jasinski_, Apr 24 2008
%H A106930 Vincenzo Librandi and Ray Chandler, <a href="/A106930/b106930.txt">Table of n, a(n) for n = 1..10000</a> [First 1000 terms from Vincenzo Librandi]
%H A106930 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 A106930 QuadPrimes2[1, -1, 16, 10000] (* see A106856 *)
%o A106930 (PARI) {a(n)= local(m,c,x); if(n<1, 0, c=0; m=1; while( c<n, m++; if( isprime(m), for(x=0,sqrtint(m\7), if(issquare(m-7*x^2), if( x%3==0, c++); break)))); m)} /* _Michael Somos_, May 28 2005 */
%K A106930 nonn,easy
%O A106930 1,1
%A A106930 _T. D. Noe_, May 09 2005