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.

A303363 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, c <= d and 2|c.

Original entry on oeis.org

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

Views

Author

Zhi-Wei Sun, Apr 22 2018

Keywords

Comments

Conjecture: a(n) > 0 for all n > 1.
This is stronger than the author's conjecture in A303233. I have verified a(n) > 0 for all n = 2..10^9.
In contrast, Corcker 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.

Examples

			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.
		

Crossrefs

Programs

  • 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(n-4^j-2^k)+1],Do[If[SQ[8(n-4^j-2^k-x(x+1)/2)+1],r=r+1],{x,0,(Sqrt[4(n-4^j-2^k)+1]-1)/2}]],{j,0,Log[4,n/2]},{k,2j,Log[2,n-4^j]}];tab=Append[tab,r],{n,1,70}];Print[tab]