A033209 -id:A033209 - cp's OEIS frontend

A106856 Primes of the form x^2 + xy + 2y^2, with x and y nonnegative.

2, 11, 23, 37, 43, 53, 71, 79, 107, 109, 127, 137, 149, 151, 163, 193, 197, 211, 233, 239, 263, 281, 317, 331, 337, 373, 389, 401, 421, 431, 443, 463, 487, 491, 499, 541, 547, 557, 569, 599, 613, 617, 641, 653, 659, 673, 683, 739, 743, 751, 757, 809, 821

Offset: 1

T. D. Noe, May 09 2005, Apr 28 2008

Discriminant=-7. Binary quadratic forms ax^2 + bxy + cy^2 have discriminant d = b^2 - 4ac.

Consider sequences of primes produced by forms with -100

The Mathematica function QuadPrimes2 is useful for finding the primes less than "lim" represented by the positive definite quadratic form ax^2 + bxy + cy^2 for any a, b and c satisfying a>0, c>0, and discriminant d<0. It does this by examining all x>=0 and y>=0 in the ellipse ax^2 + bxy + cy^2 <= lim. To find the primes generated by positive and negative x and y, compute the union of QuadPrimes2[a,b,c,lim] and QuadPrimes2[a,-b,c,lim]. - T. D. Noe, Sep 01 2009

For other programs see the "Binary Quadratic Forms and OEIS" link.

David A. Cox, Primes of the Form x^2 + n y^2, Wiley, 1989.
L. E. Dickson, History of the Theory of Numbers, Vol. 3, Chelsea, 1923.

Zak Seidov and N. J. A. Sloane, Table of n, a(n) for n = 1..10000 (The first 1225 terms were found by Zak Seidov)
N. J. A. Sloane et al., Binary Quadratic Forms and OEIS (Index to related sequences, programs, references)

Discriminants in the range -3 to -100: A007645 (d=-3), A002313 (d=-4), A045373, A106856 (d=-7), A033203 (d=-8), A056874, A106857 (d=-11), A002476 (d=-12), A033212, A106858-A106861 (d=-15), A002144, A002313 (d=-16), A106862-A106863 (d=-19), A033205, A106864-A106865 (d=-20), A106866-A106869 (d=-23), A033199, A084865 (d=-24), A002476, A106870 (d=-27), A033207 (d=-28), A033221, A106871-A106874 (d=-31), A007519, A007520, A106875-A106876 (d=-32), A106877-A106881 (d=-35), A040117, A068228, A106882 (d=-36), A033227, A106883-A106888 (d=-39), A033201, A106889 (d=-40), A106890-A106891 (d=-43), A033209, A106282, A106892-A106893 (d=-44), A033232, A106894-A106900 (d=-47), A068229 (d=-48), A106901-A106904 (d=-51), A033210, A106905-A106906 (d=-52), A033235, A106907-A106913 (d=-55), A033211, A106914-A106917 (d=-56), A106918-A106922 (d=-59), A033212, A106859 (d=-60), A106923-A106930 (d=-63), A007521, A106931 (d=-64), A106932-A106933 (d=-67), A033213, A106934-A106938 (d=-68), A033246, A106939-A106948 (d=-71), A106949-A106950 (d=-72), A033212, A106951-A106952 (d=-75), A033214, A106953-A106955 (d=-76), A033251, A106956-A106962 (d=-79), A047650, A106963-A106965 (d=-80), A106966-A106970 (d=-83), A033215, A102271, A102273, A106971-A106974 (d=-84), A033256, A106975-A106983 (d=-87), A033216, A106984 (d=-88), A106985-A106989 (d=-91), A033217 (d=-92), A033206, A106990-A107001 (d=-95), A107002-A107008 (d=-96), A107009-A107013 (d=-99).
Other collections of quadratic forms: A139643, A139827.
For a more comprehensive list of sequences giving numbers and/or primes represented by binary quadratic forms, see the "Binary Quadratic Forms and OEIS" link.
Cf. also A242660.

QuadPrimes2[a_, b_, c_, lmt_] := Module[{p, d, lst = {}, xMax, yMax}, d = b^2 - 4a*c; If[a > 0 && c > 0 && d < 0, xMax = Sqrt[lmt/a]*(1+Abs[b]/Floor[Sqrt[-d]])]; Do[ If[ 4c*lmt + d*x^2 >= 0, yMax = ((-b)*x + Sqrt[4c*lmt + d*x^2])/(2c), yMax = 0 ]; Do[p = a*x^2 + b*x*y + c*y^2; If[ PrimeQ[ p]  && p <= lmt && !MemberQ[ lst, p], AppendTo[ lst, p]], {y, 0, yMax}], {x, 0, xMax}]; Sort[ lst]];
QuadPrimes2[1, 1, 2, 1000]
(This is a corrected version of the old, incorrect, program QuadPrimes. - N. J. A. Sloane, Jun 15 2014)
max = 1000; Table[yy = {y, 1, Floor[Sqrt[8 max - 7 x^2]/4 - x/4]}; Table[ x^2 + x y + 2 y^2, yy // Evaluate], {x, 0, Floor[Sqrt[max]]}] // Flatten // Union // Select[#, PrimeQ]& (* Jean-François Alcover, Oct 04 2018 *)

list(lim)=my(q=Qfb(1,1,2), v=List([2])); forprime(p=2, lim, if(vecmin(qfbsolve(q, p))>0, listput(v,p))); Vec(v) \\ Charles R Greathouse IV, Aug 05 2016

Removed old Mathematica programs - T. D. Noe, Sep 09 2009

Edited (pointed out error in QuadPrimes, added new version of program, checked and extended b-file). - N. J. A. Sloane, Jun 06 2014

A106279 Primes p such that the polynomial x^3-x^2-x-1 mod p has 3 distinct zeros.

Original entry on oeis.org

47, 53, 103, 163, 199, 257, 269, 311, 397, 401, 419, 421, 499, 587, 599, 617, 683, 757, 773, 863, 883, 907, 911, 929, 991, 1021, 1087, 1109, 1123, 1181, 1237, 1291, 1307, 1367, 1433, 1439, 1543, 1567, 1571, 1609, 1621, 1697, 1699, 1753, 1873, 1907, 2003

Offset: 1

T. D. Noe, May 02 2005

nonn

This polynomial is the characteristic polynomial of the Fibonacci and Lucas 3-step sequences, A000073 and A001644. The periods of the sequences A000073(k) mod p and A001644(k) mod p have length less than p. For a given p, let the zeros be a, b and c. Then A001644(k) mod p = (a^k+b^k+c^k) mod p. This sequence is the same as A033209 except for the initial term.

Eric Weisstein's World of Mathematics, Fibonacci n-Step Number.

Cf. A106276 (number of distinct zeros of x^3-x^2-x-1 mod prime(n)), A106294, A106302 (periods of the Fibonacci and Lucas 3-step sequences mod prime(n)).

t=Table[p=Prime[n]; cnt=0; Do[If[Mod[x^3-x^2-x-1, p]==0, cnt++ ], {x, 0, p-1}]; cnt, {n, 500}];Prime[Flatten[Position[t, 3]]]

A243651 Nonnegative integers of the form x^2+11y^2.

Original entry on oeis.org

0, 1, 4, 9, 11, 12, 15, 16, 20, 25, 27, 36, 44, 45, 47, 48, 49, 53, 60, 64, 69, 75, 80, 81, 92, 93, 99, 100, 103, 108, 111, 115, 121, 124, 125, 132, 135, 144, 148, 155, 163, 165, 169, 176, 177, 180, 185, 188, 192, 196, 199, 201, 207, 212, 213, 220, 225, 236, 240, 243, 256, 257, 267, 268, 269, 275

Offset: 0

N. J. A. Sloane, Jun 08 2014

nonn

Discriminant -44.

N. J. A. Sloane et al., Binary Quadratic Forms and OEIS (Index to related sequences, programs, references)

Primes: A033209.

fd:=proc(a,b,c,M) local dd,xlim,ylim,x,y,t1,t2,t3,t4,i;
dd:=4*a*c-b^2;
if dd<=0 then error "Form should be positive definite."; break; fi;
t1:={};
xlim:=ceil( sqrt(M/a)*(1+abs(b)/sqrt(dd)));
ylim:=ceil( 2*sqrt(a*M/dd));
for x from 0 to xlim do
for y from -ylim to ylim do
t2 := a*x^2+b*x*y+c*y^2;
if t2 <= M then t1:={op(t1),t2}; fi; od: od:
t3:=sort(convert(t1,list));
t4:=[];
for i from 1 to nops(t3) do
if isprime(t3[i]) then t4:=[op(t4),t3[i]]; fi; od:
[[seq(t3[i],i=1..nops(t3))], [seq(t4[i],i=1..nops(t4))]];
end;
fd(1,0,11,500);

A281295 Primes which cannot be written as x^2 + 11*y^2, where x, y > 0.

Original entry on oeis.org

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 167, 173, 179, 181, 191, 193, 197, 211, 223, 227, 229, 233, 239, 241, 251, 263, 271, 277, 281, 283, 293, 307, 313, 317

Offset: 1

Arkadiusz Wesolowski, Jan 19 2017

nonn

Integers n that cannot be expressed as the product of two numbers of the form a + b*sqrt(-11), where a > 0 and b >= 0 (excluding 1 and n).

Cf. A033209.

Sort([11] cat [p: p in PrimesUpTo(317) | NormEquation(11, p) eq false]);

a(n) ~ 6/5 * n log n.

Showing 1-4 of 4 results.

cp's OEIS Frontend

A106856 Primes of the form x^2 + xy + 2y^2, with x and y nonnegative.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A106279 Primes p such that the polynomial x^3-x^2-x-1 mod p has 3 distinct zeros.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A243651 Nonnegative integers of the form x^2+11y^2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

A281295 Primes which cannot be written as x^2 + 11*y^2, where x, y > 0.

Views

Author

Keywords

Comments

Crossrefs

Programs

Magma

Formula