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!)
A128366 a(n) = least k such that the remainder when 26^k is divided by k is n. 17
5, 3, 23, 6, 7, 10, 19, 9, 17, 18, 15, 92, 18881, 319, 36091, 20, 203, 94, 49, 21, 42395, 42, 17553, 326, 106709, 27, 2062919, 36, 14099, 34, 35, 46, 850984699, 214, 5847, 44, 341, 58, 377, 106, 105, 634, 301265879, 158, 93107, 90, 759, 176, 187, 69, 685, 78 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
MATHEMATICA
t = Table[0, {10000}]; k = 1; lst = {}; While[k < 1200000000, a = PowerMod[26, k, k]; If[a < 10001 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]; If[a + 1 == k, AppendTo[lst, a]; Print@lst]]; k++ ]; lst (* Robert G. Wilson v, Jun 30 2009 *)
CROSSREFS
Sequence in context: A139699 A303634 A069607 * A083756 A283507 A290074
KEYWORD
hard,nonn
AUTHOR
Alexander Adamchuk, Feb 27 2007
EXTENSIONS
a(27) - a(52) from Robert G. Wilson v, Jun 30 2009
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 04:26 EDT 2024. Contains 370952 sequences. (Running on oeis4.)