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

A085877 Smallest square k^2 == 1 (mod 10^n) where k > 1.

Original entry on oeis.org

81, 2401, 62001, 1560001, 351600001, 47852000001, 610350000001, 586547900000001, 5508423000000001, 2032852170000000001, 184259414700000000001, 26756525040000000000001, 26756525040000000000001
Offset: 1

Views

Author

Amarnath Murthy, Jul 07 2003

Keywords

Comments

Sequence is infinite as (10^n + 1)^2 is a candidate, i.e. a(n) < = (10^n +1)^2.

Crossrefs

Cf. A085878.

Formula

a(n) = A181539(n)^2.

Extensions

Corrected and extended by Ray Chandler, Jul 09 2003
Showing 1-1 of 1 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.