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!)
A127821 a(n) = least k such that the remainder of 13^k divided by k is n. 49
2, 11, 5, 51, 44, 7, 15, 371285, 10, 74853, 158, 13757837, 17, 5805311, 22, 2181, 38, 25, 30, 9667, 74, 87, 146, 23441, 88, 19629779, 35, 45, 70, 235433, 46, 55, 34, 309, 134 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(36) > 10^16. - Max Alekseyev, Oct 25 2016
LINKS
Fausto A. C. Cariboni, Table of n, a(n) for n = 1..10000 with -1 for large entries where a(n) has not yet been found, Oct 31 2016 [With 207 new terms, this supersedes the earlier table from Robert G. Wilson v et al.]
MATHEMATICA
t = Table[0, {10000} ]; k = 1; While[ k < 3500000000, a = PowerMod[13, k, k]; If[a < 10001 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]; t
CROSSREFS
Sequence in context: A124688 A339807 A158616 * A114724 A226219 A285866
KEYWORD
nonn,hard,more
AUTHOR
Alexander Adamchuk, Jan 30 2007
EXTENSIONS
More terms from Robert G. Wilson v, Feb 06 2007
a(264), a(798), a(884), a(896), a(976), a(980), a(152), a(171), a(296), a(464), a(824), a(870) from Daniel Morel, Jun 17, Nov 30 2010
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 March 19 01:22 EDT 2024. Contains 370952 sequences. (Running on oeis4.)