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.

A303338 Number of ways to write n as x^2 + 2*y^2 + 3*2^z + 4^w with x,y,z,w nonnegative integers.

Original entry on oeis.org

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

Views

Author

Zhi-Wei Sun, Apr 22 2018

Keywords

Comments

Conjecture: a(n) > 0 for all n > 3.
This is stronger than the author's previous conjecture in A302983. It has been verified that a(n) > 0 for all n = 4..10^9.
Jiao-Min Lin (a student at Nanjing University) has found a counterexample to the conjecture: a(12558941213) = 0. - Zhi-Wei Sun, Jul 30 2022

Examples

			a(4) = 1 with 4 = 0^2 + 2*0^2 + 3*2^0 + 4^0.
a(5) = 1 with 5 = 1^2 + 2*0^2 + 3*2^0 + 4^0.
a(6) = 1 with 6 = 0^2 + 2*1^2 + 3*2^0 + 4^0.
a(9) = 2 with 9 = 0^2 + 2*1^2 + 3*2^0 + 4^1 = 0^2 + 2*1^2 + 3*2^1 + 4^0.
		

Crossrefs

Programs

  • Mathematica
    f[n_]:=f[n]=FactorInteger[n];
    g[n_]:=g[n]=Sum[Boole[MemberQ[{5,7},Mod[Part[Part[f[n],i],1],8]]&&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]);
    SQ[n_]:=SQ[n]=IntegerQ[Sqrt[n]];
    tab={};Do[r=0;Do[If[QQ[n-3*2^k-4^j],Do[If[SQ[n-3*2^k-4^j-2x^2],r=r+1],{x,0,Sqrt[(n-3*2^k-4^j)/2]}]],{k,0,Log[2,n/3]},{j,0,If[3*2^k==n,-1,Log[4,n-3*2^k]]}];tab=Append[tab,r],{n,1,70}];Print[tab]