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-2 of 2 results.

A065785 a(1) = 49; for n > 1, a(n) is the smallest square > a(n-1) with a(n-1) forming its final digits.

Original entry on oeis.org

49, 1849, 1671849, 24011671849, 408646172724011671849, 14079962896835441528408646172724011671849, 30988070410883251650062468506470600085614079962896835441528408646172724011671849
Offset: 1

Views

Author

Klaus Brockhaus, Nov 19 2001

Keywords

Comments

a(n) = A050638(n+1) for n >= 1.

Crossrefs

Cf. A050634, A050638, A065689, A065786, A065787.

A065786 a(1) = 7; for n > 1, a(n) is the square root of the smallest square > a(n-1)^2 with a(n-1)^2 forming its final digits.

Original entry on oeis.org

7, 43, 1293, 154957, 20214998707, 118659019449999845043, 5566692951015284052000000000020214998707, 21637689578064053873124753714430240419600000000000000000000118659019449999845043
Offset: 1

Views

Author

Klaus Brockhaus, Nov 19 2001

Keywords

Comments

a(n) = A050639(n+1) for n >= 1.

Crossrefs

Cf. A050635, A050639, A065690, A065785, A065787.
Showing 1-2 of 2 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.