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.

Showing 1-3 of 3 results.

A343528 Number of ways to write n as x^4 + T(y)^2 + T(z) + 2^w, where x,y,z are nonnegative integers, w is a positive integer, and T(m) denotes the triangular number m*(m+1)/2.

Original entry on oeis.org

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

Views

Author

Zhi-Wei Sun, Apr 18 2021

Keywords

Comments

Conjecture: a(n) > 0 for all n > 1.
We have verified a(n) > 0 for all 1 < n <= 2*10^7.
Conjecture verified up to 10^10. - Giovanni Resta, Apr 21 2021

Examples

			a(2) = 1 with 2 = 0^4 + T(0)^2 + T(0) + 2^1.
a(7) = 3, and 7 = 0^4 + T(0)^2 + T(2) + 2^2 = 1^4 + T(1)^2 + T(1) + 2^2 = 1^4 + T(1)^2 + T(2) + 2^1.
		

Crossrefs

Programs

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

A323463 Values of n at which A323454 reaches a new record.

Original entry on oeis.org

1, 2, 3, 99, 369, 999, 1999, 9879, 19979
Offset: 1

Views

Author

N. J. A. Sloane, Jan 23 2019

Keywords

Comments

The corresponding numbers of steps are 0, 1, 11, 12, 13, 14, 15, 16.

Examples

			a(4)=99 refers to the fact that it takes 12 steps to reach 99 from 1 using the Choix de Bruxelles (version 2) operation, and all numbers less than 99 (and not ending in 0 or 5) can be reached from 1 in fewer than 12 steps.
		

Crossrefs

Extensions

a(9) from Michael S. Branicky, Oct 01 2024

A343503 Number of ways to write n as x*(3*x+1)/2 + y*(7*y+1)/2 + 2^k, where x and y are integers, and k is a nonnegative integer.

Original entry on oeis.org

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

Views

Author

Zhi-Wei Sun, Apr 17 2021

Keywords

Comments

The author noted that a(n) > 0 for all n = 1..2*10^7. Giovanni Resta found that 8558169401 is the first value of n with a(n) = 0.

Examples

			a(1) = 1 with 1 = 0*(3*0+1)/2 + 0*(7*0+1)/2 + 2^0.
a(25) = 2, and 25 = 1*(3*1+1)/2 + 2*(7*2+1)/2 + 2^3 = (-2)*(3*(-2)+1)/2 + 1*(7*1+1)/2 + 2^4.
		

Crossrefs

Programs

  • Mathematica
    PenQ[n_]:=PenQ[n]=IntegerQ[Sqrt[24n+1]];
    tab={};Do[r=0;Do[If[PenQ[n-2^k-x(7x+1)/2],r=r+1],{k,0,Log[2,n]},{x,-Floor[(Sqrt[56(n-2^k)+1]+1)/14],(Sqrt[56(n-2^k)+1]-1)/14}];tab=Append[tab,r],{n,1,100}];Print[tab]
Showing 1-3 of 3 results.