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.

A308623 Number of ways to write n as a*(a+1)/2 + b*(b+1)/2 + 2^c*10^(2d) with a,b,c,d nonnegative integers.

Original entry on oeis.org

1, 2, 2, 3, 3, 2, 3, 5, 2, 4, 4, 3, 3, 5, 3, 3, 6, 4, 4, 5, 2, 6, 5, 4, 4, 5, 2, 4, 6, 3, 4, 8, 5, 3, 5, 4, 5, 8, 5, 5, 4, 3, 5, 7, 4, 5, 8, 4, 2, 8, 2, 6, 7, 4, 3, 4, 6, 5, 8, 4, 4, 6, 5, 5, 5, 5, 6, 8, 4, 6, 7, 4, 6, 10, 4, 4, 7, 5, 2, 10, 4, 7, 7, 4, 8, 4, 4, 7, 8, 2, 4, 9, 5, 5, 9, 5, 5, 7, 5, 6
Offset: 1

Views

Author

Zhi-Wei Sun, Jun 11 2019

Keywords

Comments

Conjecture: a(n) > 0 for all n > 0. Equivalently, any positive integer n can be written as a*(a+1)/2 + b*(b+1)/2 + 2^c*10^(2d) with a,b,c,d nonnegative integers.
This was motivated by A308566, and we verified a(n) > 0 for all n = 1..2*10^8. Then, on the author's request, Giovanni Resta verified the above conjecture for n up to 10^10. G. Resta also noted that 729546026 cannot be written as a*(a+1)/2 + b*(b+1)/2 + 2^c*3^d with a,b,c,d nonnegative integers.
See also A308566, A308594 and A308621 for similar conjectures.

Examples

			a(1) = 1 with 1 = 0*1/2 + 0*1/2 + 2^0*10^(2*0).
a(10107) = 1 with 10107 = 82*83/2 + 96*97/2 + 2^11*10^(2*0).
		

Crossrefs

Programs

  • Mathematica
    TQ[n_]:=TQ[n]=IntegerQ[Sqrt[8n+1]];
    tab={};Do[r=0;Do[If[TQ[n-10^(2k)*2^m-x(x+1)/2],r=r+1],{k,0,Log[10,n]/2},{m,0,Log[2,n/10^(2k)]},{x,0,(Sqrt[4(n-10^(2k)*2^m)+1]-1)/2}];tab=Append[tab,r],{n,1,100}];Print[tab]