

A303233


Number of ways to write n as a*(a+1)/2 + b*(b+1)/2 + 2^c + 2^d, where a,b,c,d are nonnegative integers with a <= b and c <= d.


33



0, 1, 2, 3, 4, 5, 4, 6, 7, 7, 7, 9, 7, 8, 9, 9, 8, 12, 11, 11, 11, 11, 11, 14, 11, 13, 12, 11, 10, 14, 11, 12, 17, 15, 12, 16, 14, 15, 17, 19, 15, 16, 13, 15, 17, 17, 16, 20, 16, 14, 17, 17, 14, 22, 17, 14, 14, 17, 15, 19
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


COMMENTS

Conjecture: a(n) > 0 for all n > 1. In other words, any integer n > 1 can be written as the sum of two triangular numbers and two powers of 2.
a(n) > 0 for all n = 2..10^9. See A303234 for numbers of the form x*(x+1)/2 + 2^y with x and y nonnegative integers. See also A303363 for a stronger conjecture.
In contrast, Crocker proved in 2008 that there are infinitely many positive integers not representable as the sum of two squares and at most two powers of 2.


REFERENCES

R. C. Crocker, On the sum of two squares and two powers of k, Colloq. Math. 112(2008), 235267.


LINKS

ZhiWei Sun, Table of n, a(n) for n = 1..10000
ZhiWei Sun, Refining Lagrange's foursquare theorem, J. Number Theory 175(2017), 167190.
ZhiWei Sun, New conjectures on representations of integers (I), Nanjing Univ. J. Math. Biquarterly 34(2017), no. 2, 97120.
ZhiWei Sun, Restricted sums of four squares, arXiv:1701.05868 [math.NT], 20172018.


EXAMPLE

a(2) = 1 with 2 = 0*(0+1)/2 + 0*(0+1)/2 + 2^0 + 2^0.
a(3) = 2 with 3 = 0*(0+1)/2 + 1*(1+1)/2 + 2^0 + 2^0 = 0*(0+1)/2 + 0*(0+1)/2 + 2^0 + 2^1.
a(4) = 3 with 4 = 1*(1+1)/2 + 1*(1+1)/2 + 2^0 + 2^0 = 0*(0+1)/2 + 1*(1+1)/2 + 2^0 + 2^1 = 0*(0+1)/2 + 0*(0+1)/2 + 2^1 + 2^1.


MATHEMATICA

SQ[n_]:=SQ[n]=IntegerQ[Sqrt[n]];
f[n_]:=f[n]=FactorInteger[n];
g[n_]:=g[n]=Sum[Boole[Mod[Part[Part[f[n], i], 1], 4]==3&&Mod[Part[Part[f[n], i], 2], 2]==1], {i, 1, Length[f[n]]}]==0;
QQ[n_]:=QQ[n]=(n==0)(n>0&&g[n]);
tab={}; Do[r=0; Do[If[QQ[4(n2^k2^j)+1], Do[If[SQ[8(n2^k2^jx(x+1)/2)+1], r=r+1], {x, 0, (Sqrt[4(n2^k2^j)+1]1)/2}]], {k, 0, Log[2, n]1}, {j, k, Log[2, n2^k]}]; tab=Append[tab, r], {n, 1, 60}]; Print[tab]


CROSSREFS

Cf. A000079, A000217, A271518, A273812, A281976, A299924, A299537, A299794, A300219, A300362, A300396, A300441, A301376, A301391, A301471, A301472, A302920, A302981, A302982, A302983, A302984, A302985, A303234, A303338, A303363.
Sequence in context: A279614 A212639 A212647 * A137912 A324196 A269597
Adjacent sequences: A303230 A303231 A303232 * A303234 A303235 A303236


KEYWORD

nonn


AUTHOR

ZhiWei Sun, Apr 20 2018


STATUS

approved



