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.

User: Zhuorui He

Zhuorui He's wiki page.

Zhuorui He has authored 2 sequences.

A385236 Largest x such that x^2+y^2 = A001481(n), x and y are nonnegative integers.

Original entry on oeis.org

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

Author

Zhuorui He, Jul 08 2025

Keywords

Comments

A229140(n) gives smallest x such that x^2+y^2 = A001481(n), x and y are nonnegative integers.

Examples

			For n=9, A001481(9)=13=2^2+3^2, so A229140(9)=2 and a(9)=3.
For n=14, A001481(14)=25=3^2+4^2=0^2+5^2, so A229140(14)=0 and a(14)=5.
		

Crossrefs

Programs

  • PARI
    for(n=0, 300, s=sqrtint(n); forstep(i=s, 0, -1, if(issquare(n-i*i), print1(i, ", "); break)))

Formula

a(n) = sqrt(A001481(n)) if A001481(n) is square.
a(n) = sqrt(A001481(n)-A229140(n)^2).

A385237 Smallest x such that x^3+y^3 = A004999(n), x and y are nonnegative integers.

Original entry on oeis.org

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

Author

Zhuorui He, Jul 08 2025

Keywords

Examples

			For n=9, A004999(9) = 35 = 2^3 + 3^3, so a(9) = 2.
For n=17, A004999(17) = 128 = 4^3 + 4^3, so a(17)=4.
		

Crossrefs