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.

A048559 a(n+1) is next smallest nontrivial square beginning with a(n), initial square is 4.

Original entry on oeis.org

4, 49, 49284, 4928461209, 492846120914204828164, 4928461209142048281644440027571600000000001, 49284612091420482816444400275716000000000017667716927194638935286982918857620344809476
Offset: 0

Views

Author

Patrick De Geest, May 15 1999

Keywords

Comments

Next terms are 171, 342 and 685 digits long.

Crossrefs

A048561 a(n+1) is next smallest nontrivial square beginning with a(n), initial square is 9.

Original entry on oeis.org

9, 961, 9616201, 961620162020001, 9616201620200016202000200000001, 96162016202000162020002000000018891984632653500321758097698025
Offset: 0

Views

Author

Patrick De Geest, May 15 1999

Keywords

Comments

Next terms are 125, 251, 502 and 1003 digits long.

Crossrefs

A048557 a(1) = 1; a(n+1) is next smallest nontrivial square beginning with a(n).

Original entry on oeis.org

1, 16, 169, 169744, 16974441796, 1697444179660172924176, 16974441796601729241768240010144800000000001, 1697444179660172924176824001014480000000000182400101448000000000020000000000000000000001
Offset: 1

Views

Author

Patrick De Geest, May 15 1999

Keywords

Comments

Next terms are 176, 351 and 702 digits long.

Crossrefs

Cf. A048558, A050628, A061110. See A048558 for the square roots.

Programs

  • Mathematica
    $MaxExtraPrecision = 2^10; a[n_] := a[n] = Block[{k = 10, m = a[n - 1]}, id = IntegerDigits@ m; lng = Length@ id; While[c = Ceiling[ Sqrt[ m*k]]^2; Take[ IntegerDigits@ c, lng] != id, k *= 100]; Min[c, (Sqrt[m]*10^(lng/2) + 1)^2]]; a[1] = 1; Array[a, 11] (* Robert G. Wilson v, Dec 18 2014 *)
Showing 1-3 of 3 results.