The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A177494 Least m > 1 such that m^m - 1 is divisible by a prime of the form n*m + 1 = A125556(n). 1
 2, 5, 20, 3, 6, 40, 6, 32, 30, 25, 92, 56, 12, 5, 36, 15, 18, 49, 232, 20, 70, 21, 254, 24, 24, 80, 10, 27, 68, 8, 88, 83, 150, 33, 620, 26, 870, 381, 88, 16, 42, 60, 136, 152, 34, 136, 386, 81, 324, 192, 246, 78, 786, 37, 18, 23, 86, 57, 60, 67, 558, 249, 484, 33, 636 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Joseph L. Wetherell, Table of n, a(n) for n = 1..10000 FORMULA a(n) = (A125556(n) - 1)/n. PROG (PARI) a(n) = forprime(p=3, , if (!((p-1) % n) && (m = (p-1)/n) && (m > 1) && !((m^m-1) % p), return (m)); ); \\ Michel Marcus, Nov 18 2017 CROSSREFS Cf. A125556 (smallest prime p = n*m + 1 that divides m^m - 1 for some m > 1). Sequence in context: A260140 A270556 A059079 * A136900 A136898 A077138 Adjacent sequences: A177491 A177492 A177493 * A177495 A177496 A177497 KEYWORD nonn AUTHOR Alexander Adamchuk, May 10 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.

Last modified December 8 23:37 EST 2023. Contains 367681 sequences. (Running on oeis4.)