The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085878 Smallest n-th power k^n == 1 (mod 10^n), where k>1. 1
11, 2401, 1003003001, 38513670001, 3200800080004000100001, 109572174941077441712143556000001, 10000007000002100000350000035000002100000070000001 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Sequence is infinite as (10^n + 1)^n is a candidate, or a(n) < = (10^n +1)^n.
LINKS
EXAMPLE
a(2) = 49^2= 2401 == 1 (mod 100).
CROSSREFS
Cf. A085877.
Sequence in context: A272617 A301473 A087403 * A238633 A266815 A064779
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Jul 07 2003
EXTENSIONS
More terms from Ray Chandler, Jul 12 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 13 15:50 EDT 2024. Contains 372521 sequences. (Running on oeis4.)