This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A262785 Number of ordered ways to write n as x^2 + y^2 + p*(p+d)/2, where 0 <= x <= y, d is 1 or -1, and p is prime. 7

%I

%S 1,1,3,2,3,2,3,3,1,3,5,3,2,3,3,4,2,2,6,4,4,2,6,2,2,5,2,7,4,4,4,5,3,1,

%T 7,2,5,4,4,5,4,3,3,5,1,6,4,3,1,3,5,3,8,2,7,6,3,2,4,5,3,4,2,6,5,4,5,9,

%U 2,3,9,1,5,5,7,4,3,5,5,7,3,5,7,5,3,8,4,7,4,2,9,7,6,2,9,6,1,3,3,9

%N Number of ordered ways to write n as x^2 + y^2 + p*(p+d)/2, where 0 <= x <= y, d is 1 or -1, and p is prime.

%C Conjecture: (i) a(n) > 0 for all n > 0, and a(n) = 1 only for n = 1, 2, 9, 34, 45, 49, 72, 97, 241, 337, 538.

%C (ii) Any integer n > 9 can be written as x^2 + y^2 + z*(z+1), where x,y,z are nonnegative integers with z-1 or z+1 prime.

%C In 2015, the author refined a result of Euler by proving that any positive integer can be written as the sum of two squares and a positive triangular number.

%H Zhi-Wei Sun, <a href="/A262785/b262785.txt">Table of n, a(n) for n = 1..10000</a>

%H Zhi-Wei Sun, <a href="http://dx.doi.org/10.4064/aa127-2-1">Mixed sums of squares and triangular numbers</a>, Acta Arith. 127(2007), 103-113.

%H Zhi-Wei Sun, <a href="http://oeis.org/abs/1502.03056">On universal sums ax^2+by^2+f(z), aT_x+bT_y+f(z) and aT_x+by^2+f(z)</a>, arXiv:1502.03056 [math.NT], 2015.

%e a(1) = 1 since 1 = 0^2 + 0^2 + 2*(2-1)/2 with 2 prime.

%e a(2) = 1 since 2 = 0^2 + 1^2 + 2*(2-1)/2 with 2 prime.

%e a(3) = 3 since 3 = 0^2 + 0^2 + 2*(2+1)/2 = 0^2 + 0^2 + 3*(3-1)/2 = 1^2 + 1^2 + 2*(2-1)/2 with 2 and 3 both prime.

%e a(9) = 1 since 9 = 2^2 + 2^2 + 2*(2-1)/2 with 2 prime.

%e a(34) = 1 since 34 = 2^2 + 3^2 + 7*(7-1)/2 with 7 prime.

%e a(45) = 1 since 45 = 1^2 + 4^2 + 7*(7+1)/2 with 7 prime.

%e a(49) = 1 since 49 = 3^2 + 5^2 + 5*(5+1)/2 with 5 prime.

%e a(72) = 1 since 72 = 1^2 + 4^2 + 11*(11-1)/2 with 11 prime.

%e a(97) = 1 since 97 = 1^2 + 9^2 + 5(5+1)/2 with 5 prime.

%e a(241) = 1 since 241 = 1^2 + 15^2 + 5*(5+1)/2 with 5 prime.

%e a(337) = 1 since 337 = 5^2 + 6^2 + 23*(23+1)/2 with 23 prime.

%e a(538) = 1 since 538 = 3^2 + 8^2 + 31*(31-1)/2 with 31 prime.

%t SQ[n_]:=IntegerQ[Sqrt[n]]

%t f[d_,n_]:=Prime[n](Prime[n]+(-1)^d)/2

%t Do[r=0;Do[If[SQ[n-f[d,k]-x^2],r=r+1],{d,0,1},{k,1,PrimePi[(Sqrt[8n+1]-(-1)^d)/2]},{x,0,Sqrt[(n-f[d,k])/2]}];Print[n," ",r];Continue,{n,1,100}]

%Y Cf. A000040, A000290, A000217, A001481, A254885, A262311, A262781.

%K nonn

%O 1,3

%A _Zhi-Wei Sun_, Oct 01 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 18 08:08 EDT 2019. Contains 328146 sequences. (Running on oeis4.)