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.

A050646 a(n+1) is next smallest cube ending with a(n), initial term is 1.

Original entry on oeis.org

1, 1331, 1003303631331, 1000000003003300003006603631003303631331
Offset: 1

Views

Author

Patrick De Geest, Jul 15 1999

Keywords

Comments

a(5) contains 121 digits.

Crossrefs

Cf. A050647, A048563, A050640.

Formula

a(n) = A050647(n)^3.
a(n) = (Sum_{i=0..n-1} 10^((3^i-1)/2) )^3. - Max Alekseyev, Jan 07 2015

A234605 a(n+1) is next smallest cube ending with a(n), initial term is 0.

Original entry on oeis.org

0, 1000, 1331000, 1003303631331000, 1000000003003300003006603631003303631331000
Offset: 1

Views

Author

Derek Orr, Dec 28 2013

Keywords

Comments

a(6) is too large to include (contains 124 digits).

Crossrefs

Cf. A050646, A050647, A050648, A050650.

Programs

  • Mathematica
    a[n_]:=(Sum[10^((3^i+1)/2),{i,0,n-1}])^3; Array[a,5,0] (* Stefano Spezia, Mar 07 2025 *)

Formula

For n>1, a(n) = 1000*A050646(n-1) = 1000*A050647(n-1)^3.
a(n) = (Sum_{i=0..n-1} 10^((3^i+1)/2))^3. - Max Alekseyev, Jan 07 2015

A050641 a(n+1)^3 is next smallest nontrivial cube containing a(n)^3 as a substring.

Original entry on oeis.org

1, 5, 45, 3632, 781253632
Offset: 1

Views

Author

Patrick De Geest, Jul 15 1999

Keywords

Comments

a(n+1) <= 10^m + a(n) where m is the number of digits of a(n)^3. - Chai Wah Wu, Mar 01 2019

Crossrefs

Cf. A050640, A048564, A050647.

Extensions

a(5) from Chai Wah Wu, Mar 01 2019
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.