login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003566 Least number m such that 10^m = +- 1 mod 10n + 1. 2
1, 6, 15, 5, 16, 30, 35, 9, 3, 2, 3, 11, 65, 46, 75, 33, 18, 90, 95, 33, 15, 48, 6, 15, 25, 28, 5, 14, 96, 42, 155, 53, 55, 30, 6, 171, 78, 42, 176, 100, 8, 70, 215, 42, 10, 230, 78, 6, 245, 166, 24, 26, 58, 270, 252, 16 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Harvey P. Dale, Table of n, a(n) for n = 0..1000

MATHEMATICA

lnm[n_]:=Module[{m=1}, While[!MemberQ[{1, 10n}, Mod[10^m, 10n+1]], m++]; m]; Array[lnm, 60] (* Harvey P. Dale, Mar 14 2014 *)

CROSSREFS

Sequence in context: A019306 A115408 A105052 * A205149 A289722 A070870

Adjacent sequences:  A003563 A003564 A003565 * A003567 A003568 A003569

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 22 10:24 EDT 2019. Contains 328317 sequences. (Running on oeis4.)