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.

A303399 Number of ordered pairs (a, b) with 0 <= a <= b such that n - 5^a - 5^b can be written as the sum of two triangular numbers.

Original entry on oeis.org

0, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 3, 3, 2, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 1, 4, 3, 3, 2, 5, 4, 4, 4, 3, 3, 4, 4, 3, 4, 4, 4, 3, 2, 4, 3, 3, 3, 5, 2, 4, 5, 4, 4, 4, 4, 3, 5, 3, 4, 4, 4, 4, 4, 3, 3, 5, 4, 5, 3, 3, 5, 5, 2, 4, 6, 3, 3, 4, 4, 3
Offset: 1

Views

Author

Zhi-Wei Sun, Apr 23 2018

Keywords

Comments

Conjecture: a(n) > 0 for all n > 1.
This is equivalent to the author's conjecture in A303389. It has been verified that a(n) > 0 for all n = 2..6*10^9.
Note that a nonnegative integer m is the sum of two triangular numbers if and only if 4*m + 1 can be written as the sum of two squares.

Examples

			a(6) = 2 with 6 - 5^0 - 5^0 = 1*(1+1)/2 + 2*(2+1)/2 and 6 - 5^0 - 5^1 = 0*(0+1)/2 + 0*(0+1)/2.
a(7) = 1 with 7 - 5^0 - 5^1 = 0*(0+1)/2 + 1*(1+1)/2.
a(25) = 1 with 25 - 5^1 - 5^1 = 0*(0+1)/2 + 5*(5+1)/2.
		

Crossrefs

Programs

  • Mathematica
    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-5^j-5^k)+1],r=r+1],{j,0,Log[5,n/2]},{k,j,Log[5,n-5^j]}];tab=Append[tab,r],{n,1,80}];Print[tab]