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.

A065789 a(1) = 8; 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

8, 42, 2458, 310042, 2929997542, 1046218875000310042, 406005268741864709999999997070002458, 50376698115810287966925579573179705000000000000000001046218875000310042
Offset: 1

Views

Author

Klaus Brockhaus, Nov 19 2001

Keywords

Comments

a(n) = A050637(n+1) for n >= 1; a(n) = sqrt(A065788(n)).
Essentially the same as A050637. - Zak Seidov, Mar 12 2012

Crossrefs

A065788 a(1) = 64; 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

64, 1764, 6041764, 96126041764, 8584885596126041764, 1094573934406914368584885596126041764, 164840278246153785356947805564195221094573934406914368584885596126041764
Offset: 1

Views

Author

Klaus Brockhaus, Nov 19 2001

Keywords

Comments

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

Crossrefs

Programs

  • Mathematica
    nxt[n_]:=Module[{k=1},While[!IntegerQ[Sqrt[k*10^IntegerLength[n]+n]],k++];k*10^IntegerLength[n]+n]; NestList[nxt,64,6] (* Harvey P. Dale, Dec 14 2019 *)
Showing 1-2 of 2 results.