The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A055689 Numbers k such that 6^k == -1 (mod k-1). 3
 2, 38, 16987850, 2416266950, 5995229030, 7193673830, 11465419550, 17783484530, 72155530502, 142013229530, 174523785590, 189282539138, 294183810998, 302690164298, 354613312130, 774557575610, 933821938790, 1407294504938, 1974020768390, 2112969494570, 2878251281402, 3239815009970, 3756030401750, 3915556797110, 6086837726270, 6154479362702, 6760841132870, 7412805544190, 7430816963570, 10197159330050, 12162461471270, 15374128532210, 15561152727890, 17132853402170, 17728631282570, 25843631671550, 38138222902514, 39974191417010, 56482483860710, 71475592618370, 78107027121482 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS MATHEMATICA Do[If[PowerMod[6, n, n-1]==n-2, Print[n]], {n, 2, 10^8}] CROSSREFS Sequence in context: A132396 A263374 A066244 * A345316 A028442 A062982 Adjacent sequences:  A055686 A055687 A055688 * A055690 A055691 A055692 KEYWORD nonn AUTHOR Robert G. Wilson v, Jun 09 2000 EXTENSIONS Terms a(4) onward from Max Alekseyev, Oct 12 2012 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.

Last modified December 5 20:39 EST 2021. Contains 349558 sequences. (Running on oeis4.)