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.

Previous Showing 11-13 of 13 results.

A065792 a(1) = 9; 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

9, 41, 1209, 469959, 176270001209, 6042408942999999530041, 16385871165869048127200000000000176270001209, 28444329561227422116741433513058707457037799999999999999999999993957591057000000469959
Offset: 1

Views

Author

Klaus Brockhaus, Nov 19 2001

Keywords

Comments

a(n) = A050635(n+1) for n >= 1; a(n) = sqrt(A065791(n)).

Crossrefs

A050629 a(n+1)^2 is next smallest nontrivial square containing a(n)^2 as a substring, initial term is 1.

Original entry on oeis.org

1, 4, 13, 237, 6013, 3655347, 6491041181267
Offset: 1

Views

Author

Patrick De Geest, Jul 15 1999

Keywords

Crossrefs

Formula

a(n) = sqrt(A050628(n)).

Extensions

a(7) from Max Alekseyev, Feb 15 2012

A065808 Square of n has a smaller square as its final digits.

Original entry on oeis.org

7, 8, 9, 10, 11, 12, 13, 15, 17, 18, 19, 20, 21, 22, 23, 25, 27, 28, 29, 30, 31, 32, 33, 35, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 65, 67, 68, 69, 70, 71, 72, 73, 75, 77, 78, 79, 80, 81, 82, 83, 85, 87, 88
Offset: 1

Views

Author

Klaus Brockhaus, Nov 22 2001

Keywords

Comments

Includes all n >= 7 not == 4 or 6 (mod 10). - Robert Israel, Oct 24 2017

Crossrefs

A065807 gives the corresponding squares.

Programs

  • Maple
    filter:= n ->
      ormap(t -> issqr(n^2 mod 10^t), [$1..ilog10(n^2)]):
    select(filter, [$1..100]); # Robert Israel, Oct 24 2017
  • Mathematica
    ds[n_] := NestWhileList[FromDigits[Rest[IntegerDigits[#]]] &, n, # > 9 &]; Select[Range[4, 88], Or @@ IntegerQ /@ Sqrt[Rest[ds[#^2]]] &] (* Jayanta Basu, Jul 10 2013 *)
  • PARI
    a065808(m) = local(k, a, b, d, j, n, r); for(k=1, m, a=length(Str(n))-1; b=1; j=1; n=k^2; while(b, d=divrem(n, 10^j); if(d[1]>0&&issquare(d[2]), b=0; issquare(n, &r); print1(r, ","), if(j
    				

Extensions

Offset changed to 1 by Robert Israel, Oct 24 2017
Previous Showing 11-13 of 13 results.