A020670 -id:A020670 - cp's OEIS frontend

A155568 Intersection of A001481 inter A020670: N = a^2 + b^2 = c^2 + 7d^2 for some integers a,b,c,d.

0, 1, 4, 8, 9, 16, 25, 29, 32, 36, 37, 49, 53, 64, 72, 81, 100, 109, 113, 116, 121, 128, 137, 144, 148, 149, 169, 193, 196, 197, 200, 212, 225, 232, 233, 256, 261, 277, 281, 288, 289, 296, 317, 324, 333, 337, 361, 373, 389, 392, 400, 401, 421, 424, 436, 441, 449

Offset: 1

M. F. Hasler, Jan 25 2009

Contains A155578 as a subsequence (obtained by restricting a,b,c,d to be nonzero). Also contains A000290 (squares) as subsequence.

Cf. A001481, A002479, A003136, A002481, A020668 ff.

isA155568(n,/* use optional 2nd arg to get other analogous sequences */c=[7,1]) = { for(i=1,#c, for(b=0,sqrtint(n\c[i]), issquare(n-c[i]*b^2) & next(2)); return);1}
for( n=0,500, isA155568(n) & print1(n","))

A249545 a(n) = number of representations of A020670(n) as x^2 + 7*y^2.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 3, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 4, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 4, 1, 1, 3, 1, 1, 1, 1

Offset: 1

Zak Seidov, Oct 31 2014

nonn

Among first 10000 terms, maximal value is 12 for n = 5875, 7320, 9211.

That is, numbers A020670(5875, 7320, 9211) = (32384, 40832, 52096) are expressible as x^2 + 7*y^2 in 12 ways. E.g., 32384 = x^2 + 7*y^2 for {x,y}= {4, 68}, {31, 67}, {53, 65}, {74, 62}, {94, 58}, {116, 52}, {122, 50}, {151, 37}, {164, 28}, {172, 20}, {178, 10}, {179, 7}.

Zak Seidov, Table of n, a(n) for n = 1..10000

Cf. A020670.

A155717 Numbers of the form N = a^2 + 7b^2 for some positive integers a,b.

Original entry on oeis.org

8, 11, 16, 23, 29, 32, 37, 43, 44, 53, 56, 64, 67, 71, 72, 77, 79, 88, 92, 99, 107, 109, 112, 113, 116, 121, 127, 128, 137, 144, 148, 149, 151, 161, 163, 172, 176, 179, 184, 191, 193, 197, 200, 203, 207, 211, 212, 224, 232, 233, 239, 253, 256, 259, 261, 263, 268

Offset: 1

M. F. Hasler, Jan 25 2009

Subsequence of A020670 (which allows for a and b to be zero).

If N=a^2+7*b^2 is a term then 7*N=(7*b)^2+7*a^2 is also a term. Conversely,if 7*N is a term then N is a term. Example: N=56; N/7=8 is a term, N*7=7^2+7*7^2 is a term. Sequences A154777, A092572 and A154778 have the same property with 7 replaced by prime numbers 2,3 and 5 respectively. - Jerzy R Borysowicz, May 22 2020

Cf. A000404, A154777, A092572, A097268, A154778, A155707-A155716, A155560-A155578.

Select[Range[300], Reduce[a>0 && b>0 && # == a^2 + 7b^2, {a, b}, Integers] =!= False&] (* Jean-François Alcover, Nov 17 2016 *)

isA155717(n,/* optional 2nd arg allows us to get other sequences */c=7) = { for(b=1,sqrtint((n-1)\c), issquare(n-c*b^2) & return(1))}
for( n=1,300, isA155717(n) & print1(n","))

def aupto(limit):
    cands = range(1, int(limit**.5)+2)
    nums = [a**2 + 7*b**2 for a in cands for b in cands]
    return sorted(set(k for k in nums if k <= limit))
print(aupto(268)) # Michael S. Branicky, Aug 11 2021

A216451 Numbers which are simultaneously of the form x^2+y^2, x^2+2y^2, x^2+3y^2, x^2+7y^2, all with x>0, y>0.

Original entry on oeis.org

193, 337, 457, 673, 772, 1009, 1033, 1129, 1201, 1297, 1348, 1737, 1801, 1828, 1873, 2017, 2137, 2377, 2473, 2521, 2689, 2692, 2713, 2857, 3033, 3049, 3088, 3217, 3313, 3361, 3529, 3600, 3697, 3889, 4036, 4057, 4113, 4132, 4153, 4201, 4516, 4561, 4624, 4657

Offset: 1

V. Raman, Sep 07 2012

nonn

A number can be written as a^2+b^2 if and only if it has no prime factor congruent to 3 (mod 4) raised to an odd power.
A number can be written as a^2+2*b^2 if and only if it has no prime factor congruent to 5 (mod 8) or 7 (mod 8) raised to an odd power.
A number can be written as a^2+3*b^2 if and only if it has no prime factor congruent to 2 (mod 3) raised to an odd power.
A number can be written as a^2+7*b^2 if and only if it has no prime factor congruent to 3 (mod 7) or 5 (mod 7) or 6 (mod 7) raised to an odd power. Also the power of 2 should not be 1, if it can be written in the form a^2+7*b^2.

V. Raman, Table of n, a(n) for n = 1..1000

Cf. A154777, A092572.

Intersection of A001481, A002479, A003136 and A020670, omitting squares. See also A216500. - N. J. A. Sloane, Sep 11 2012

nn = 4657; lim = Floor[Sqrt[nn]]; t1 = Select[Union[Flatten[Table[a^2 + b^2, {a, lim}, {b, lim}]]], # <= nn &]; t2 = Select[Union[Flatten[Table[a^2 + 2*b^2, {a, lim}, {b, lim/Sqrt[2]}]]], # <= nn &]; t3 = Select[Union[Flatten[Table[a^2 + 3*b^2, {a, lim}, {b, lim/Sqrt[3]}]]], # <= nn &]; t7 = Select[Union[Flatten[Table[a^2 + 7*b^2, {a, lim}, {b, lim/Sqrt[7]}]]], # <= nn &]; Intersection[t1, t2, t3, t7] (* T. D. Noe, Sep 08 2012 *)

Definition clarified by N. J. A. Sloane, Sep 11 2012

A033207 Primes of the form x^2 + 7*y^2.

Original entry on oeis.org

7, 11, 23, 29, 37, 43, 53, 67, 71, 79, 107, 109, 113, 127, 137, 149, 151, 163, 179, 191, 193, 197, 211, 233, 239, 263, 277, 281, 317, 331, 337, 347, 359, 373, 379, 389, 401, 421, 431, 443, 449, 457, 463, 487, 491

Offset: 1

N. J. A. Sloane

Except for a(1) = 7, these are the primes which can be written in the form a^2 + 7*b^2 with a > 0 and b > 0. - V. Raman, Sep 08 2012

These are the primes p for which p^3 - 1 is divisible by 7, with two exceptions: p = 2 is not in the sequence even though 2^3 - 1 is divisible by 7, and p = 7 is in the sequence even though 7^3 - 1 is not divisible by 7. Except for p = 7, if p^3 - 1 is not divisible by 7, it is congruent to 5 (mod 7). - Richard R. Forberg, Jun 03 2013

David A. Cox, "Primes of the Form x^2 + n y^2", Wiley, 1989.

Ray Chandler, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)
Sushma Palimar and B. R. Shankar, Mersenne Primes in Real Quadratic Fields, Journal of Integer Sequences, Vol. 15 (2012), #12.5.6.
N. J. A. Sloane et al., Binary Quadratic Forms and OEIS (Index to related sequences, programs, references)

Essentially the same as A045373. Primes in A020670.

Cf. A002344, A002345, A139643.

QuadPrimes2[1, 0, 7, 10000] (* see A106856 *)

is(n)=kronecker(n,7)>=0 && isprime(n) && n>2 \\ Charles R Greathouse IV, Nov 19 2012

Primes congruent to {1, 7, 9, 11, 15, 23, 25} (mod 28). - T. D. Noe, Apr 29 2008

A216501 Let S_k = {x^2+k*y^2: x,y positive integers}. How many out of S_1, S_2, S_3, S_7 does n belong to?

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 2, 0, 0, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 0, 1, 2, 1, 2, 0, 2, 3, 1, 1, 1, 2, 0, 3, 2, 1, 0, 0, 2, 1, 1, 1, 2, 2, 1, 0, 1, 2, 1, 1, 0, 2, 0, 1, 2, 1, 1, 3, 2, 0, 0, 1, 3, 3, 1, 1, 2, 1, 0, 2, 1, 1, 2, 1, 1, 1, 1, 0, 2, 2, 1, 1, 1, 1, 0, 0, 1, 3, 1, 2, 2, 1, 1, 1, 1, 0, 1, 2, 2, 3, 0, 1, 2, 3, 1, 0, 2, 2, 1, 0, 0

Offset: 1

V. Raman, Sep 07 2012

nonn

"If a composite number C is of the form a^2 + kb^2 for some integers a & b, then every prime factor P (of C) raised to an odd power is of the form c^2 + kd^2, for some integers c & d."
This statement is only true for k = 1, 2, 3. For k = 7, with the exception of the prime factor 2, the statement mentioned above is true.
A number can be written as a^2 + b^2 if and only if it has no prime factor congruent to 3 (mod 4) raised to an odd power.
A number can be written as a^2 + 2b^2 if and only if it has no prime factor congruent to 5 (mod 8) or 7 (mod 8) raised to an odd power.
A number can be written as a^2 + 3b^2 if and only if it has no prime factor congruent to 2 (mod 3) raised to an odd power.
A number can be written as a^2 + 7b^2 if and only if it has no prime factor congruent to 3 (mod 7) or 5 (mod 7) or 6 (mod 7) raised to an odd power and the exponent of 2 is not 1.

Cf. A000290, A001481, A002479, A003136, A020670, A216451, A216500, A154777, A092572.

for(n=1, 100, sol=0; for(x=1, 100, if(issquare(n-x*x)&&n-x*x>0, sol++; break)); for(x=1, 100, if(issquare(n-2*x*x)&&n-2*x*x>0, sol++; break)); for(x=1, 100, if(issquare(n-3*x*x)&&n-3*x*x>0, sol++; break)); for(x=1, 100, if(issquare(n-7*x*x)&&n-7*x*x>0, sol++; break)); print1(sol", ")) /* V. Raman, Oct 16 2012 */

a(n) = 0 for almost all n. - Charles R Greathouse IV, Sep 14 2012

Edited by N. J. A. Sloane, Sep 11 2012

A216671 Let S_k = {x^2+k*y^2: x,y nonnegative integers}. How many out of S_1, S_2, S_3, S_7 does n belong to?

Original entry on oeis.org

4, 2, 2, 4, 1, 1, 2, 3, 4, 1, 2, 2, 2, 0, 0, 4, 2, 2, 2, 1, 1, 1, 1, 1, 4, 1, 2, 2, 2, 0, 1, 3, 1, 2, 0, 4, 3, 1, 1, 1, 2, 0, 3, 2, 1, 0, 0, 2, 4, 2, 1, 2, 2, 1, 0, 1, 2, 1, 1, 0, 2, 0, 2, 4, 1, 1, 3, 2, 0, 0, 1, 3, 3, 1, 2, 2, 1, 0, 2, 1, 4, 2, 1, 1, 1, 1, 0, 2, 2, 1, 1, 1, 1, 0, 0, 1, 3, 2, 2, 4, 1, 1, 1, 1, 0, 1, 2, 2, 3, 0, 1, 2, 3, 1, 0, 2, 2, 1, 0, 0

Offset: 1

V. Raman, Sep 13 2012

nonn

"If a composite number C is of the form a^2 + kb^2 for some integers a & b, then every prime factor of C raised to an odd power is of the form c^2 + kd^2 for some integers c & d."
This statement is only true for k = 1, 2, 3.
For k = 7, with the exception of the prime factor 2, the statement mentioned above is true.
A number can be written as a^2 + b^2 if and only if it has no prime factor congruent to 3 (mod 4) raised to an odd power.
A number can be written as a^2 + 2b^2 if and only if it has no prime factor congruent to 5 (mod 8) or 7 (mod 8) raised to an odd power.
A number can be written as a^2 + 3b^2 if and only if it has no prime factor congruent to 2 (mod 3) raised to an odd power.
A number can be written as a^2 + 7b^2 if and only if it has no prime factor congruent to 3 (mod 7) or 5 (mod 7) or 6 (mod 7) raised to an odd power, and the exponent of 2 is not 1.
Comment from N. J. A. Sloane, Sep 14 2012: S_1, S_2, S_3, S_7 are the first four quadratic forms with class number 1. (See Cox, for example.)

David A. Cox, Primes of the Form x^2 + n y^2, Wiley, 1989. - From N. J. A. Sloane, Sep 14 2012

Cf. A000290, A001481, A002479, A003136, A020670, A216451, A216500.

Cf. A154777, A092572.

for(n=1, 100, sol=0; for(x=0, 100, if(issquare(n-x*x)&&n-x*x>=0, sol++; break)); for(x=0, 100, if(issquare(n-2*x*x)&&n-2*x*x>=0, sol++; break)); for(x=0, 100, if(issquare(n-3*x*x)&&n-3*x*x>=0, sol++; break)); for(x=0, 100, if(issquare(n-7*x*x)&&n-7*x*x>=0, sol++; break)); print1(sol", ")) /* V. Raman, Oct 16 2012 */

The fraction of terms with a(n)>0 goes to zero as n increases. - Charles R Greathouse IV, Sep 11 2012

Edited by N. J. A. Sloane, Sep 14 2012

A216512 Number of nonnegative integer solutions to the equation a^2 + 7*b^2 = n.

Original entry on oeis.org

1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 2, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 3, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0

Offset: 1

V. Raman, Sep 08 2012

nonn

Aung Phone Maw, On the Number of Ways a Natural Number Can Be Written in the Form 7a^2+b^2, arXiv:2408.01763 [math.GM], 2024.

Cf. A020670.

r[n_] := Reduce[x >= 0 && y >= 0 && x^2 + 7 y^2 == n, Integers];
a[n_] := Which[rn = r[n]; rn === False, 0, Head[rn] === And, 1, Head[rn] === Or, Length[rn], True, -1];
Table[a[n], {n, 1, 87}] (* Jean-François Alcover, Jun 24 2017 *)

A338162 Number of ways to write 4n + 1 as x^2 + y^2 + z^2 + w^2 with x^2 + 7y^2 = 2^k for some k = 0,1,2,..., where x, y, z, w are nonnegative integers with z <= w.

Original entry on oeis.org

1, 2, 3, 2, 4, 4, 2, 3, 6, 3, 7, 6, 5, 6, 7, 3, 8, 9, 5, 6, 8, 4, 8, 7, 4, 8, 11, 3, 7, 8, 6, 8, 13, 6, 6, 8, 6, 9, 11, 8, 10, 12, 7, 7, 12, 5, 14, 14, 7, 7, 13, 5, 13, 13, 5, 8, 13, 8, 10, 10, 7, 13, 10, 6, 9, 14, 9, 10, 15, 7, 10

Offset: 0

Zhi-Wei Sun, Oct 14 2020

nonn

Conjecture: a(n) > 0 for all n >= 0. Moreover, if m > 1 has the form 2^a*(2*b+1), and either a is positive and even, or b is even, then m can be written as x^2 + y^2 + z^2 + w^2 with x^2 + 7*y^2 = 2^k for some positive integer k, where x, y, z, w are nonnegative integers.

We have verified the latter assertion in the conjecture for m up to 4*10^8.

			a(0) = 1, and 4*0 + 1 = 1^2 + 0^2 + 0^2 +0^2 with 1^2 + 7*0^2 = 2^0.
a(25) = 2, and 25 = 2^2 + 2^2 + 1^2 + 4^2 = 4^2 + 0^2 + 0^2 + 3^2
with 2^2 + 7*2^2 = 2^5 and 4^2 + 7*0^2 = 2^4.

Zhi-Wei Sun, Table of n, a(n) for n = 0..10000
Zhi-Wei Sun, Refining Lagrange's four-square theorem, J. Number Theory 175(2017), 167-190. See also arXiv:1604.06723 [math.NT].
Zhi-Wei Sun, Restricted sums of four squares, Int. J. Number Theory 15(2019), 1863-1893. See also arXiv:1701.05868 [math.NT].
Zhi-Wei Sun, Sums of four squares with certain restrictions, arXiv:2010.05775 [math.NT], 2020.

Cf. A000079, A000118, A000290, A020670, A337082, A338094, A338095, A338096, A338139.

SQ[n_]:=SQ[n]=IntegerQ[Sqrt[n]];
PQ[n_]:=PQ[n]=IntegerQ[Log[2,n]];
tab={};Do[r=0;Do[If[SQ[4n+1-x^2-y^2-z^2]&&PQ[x^2+7y^2],r=r+1],{x,1,Sqrt[4n+1]},{y,0,Sqrt[4n+1-x^2]},{z,0,Sqrt[(4n+1-x^2-y^2)/2]}];tab=Append[tab,r],{n,0,70}];tab

A054151 Number of positive integers <= 2^n of form x^2 + 7 y^2.

Original entry on oeis.org

1, 1, 2, 4, 7, 12, 21, 39, 69, 130, 240, 451, 854, 1620, 3101, 5941, 11443, 22080, 42724, 82835, 160914, 313149, 610230, 1190802, 2326448, 4550161, 8908095, 17455391, 34232368, 67184426, 131949378, 259313689, 509925468, 1003302084

Offset: 0

David W. Wilson

nonn

Index entries for sequences related to populations of quadratic forms

Cf. A020670.

cp's OEIS Frontend

A155568 Intersection of A001481 inter A020670: N = a^2 + b^2 = c^2 + 7d^2 for some integers a,b,c,d.

Views

Author

Keywords

Comments

Crossrefs

Programs

PARI

A249545 a(n) = number of representations of A020670(n) as x^2 + 7*y^2.

Views

Author

Keywords

Comments

Links

Crossrefs

A155717 Numbers of the form N = a^2 + 7b^2 for some positive integers a,b.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI

Python

A216451 Numbers which are simultaneously of the form x^2+y^2, x^2+2y^2, x^2+3y^2, x^2+7y^2, all with x>0, y>0.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Extensions

A033207 Primes of the form x^2 + 7*y^2.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A216501 Let S_k = {x^2+k*y^2: x,y positive integers}. How many out of S_1, S_2, S_3, S_7 does n belong to?

Views

Author

Keywords

Comments

Crossrefs

Programs

PARI

Formula

Extensions

A216671 Let S_k = {x^2+k*y^2: x,y nonnegative integers}. How many out of S_1, S_2, S_3, S_7 does n belong to?

Views

Author

Keywords

Comments

References

Crossrefs

Programs

PARI

Formula

Extensions

A216512 Number of nonnegative integer solutions to the equation a^2 + 7*b^2 = n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

A338162 Number of ways to write 4*n + 1 as x^2 + y^2 + z^2 + w^2 with x^2 + 7*y^2 = 2^k for some k = 0,1,2,..., where x, y, z, w are nonnegative integers with z <= w.

Views

Author

A338162 Number of ways to write 4n + 1 as x^2 + y^2 + z^2 + w^2 with x^2 + 7y^2 = 2^k for some k = 0,1,2,..., where x, y, z, w are nonnegative integers with z <= w.