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.

A085878 Smallest n-th power k^n == 1 (mod 10^n), where k>1.

Original entry on oeis.org

11, 2401, 1003003001, 38513670001, 3200800080004000100001, 109572174941077441712143556000001, 10000007000002100000350000035000002100000070000001
Offset: 1

Views

Author

Amarnath Murthy, Jul 07 2003

Keywords

Comments

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

Examples

			a(2) = 49^2= 2401 == 1 (mod 100).
		

Crossrefs

Cf. A085877.

Extensions

More terms from Ray Chandler, Jul 12 2003