This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A105286 Numbers n such that prime(n+1) == 1 (mod n). 4
 1, 2, 3, 10, 24, 25, 66, 168, 182, 186, 187, 188, 438, 6462, 40071, 40084, 40085, 40091, 40108, 40118, 251745, 637224, 637306, 637336, 637338, 10553441, 10553445, 10553452, 10553479, 10553515, 10553550, 10553829, 27067032, 27067054 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS MATHEMATICA bb={}; Do[If[1==Mod[Prime[n+1], n], bb=Append[bb, n]], {n, 1, 200000}]; bb PROG (Sage) def A105286(max) : ....terms = [] ....p = 3 ....for n in xrange(1, max+1) : ........if (p - 1) % n == 0 : terms.append(n) ........p = next_prime(p) ....return terms end # Eric M. Schmidt, Feb 05 2013 CROSSREFS Sequence in context: A130002 A320812 A162034 * A295616 A059929 A123029 Adjacent sequences:  A105283 A105284 A105285 * A105287 A105288 A105289 KEYWORD nonn AUTHOR Zak Seidov, Apr 25 2005 EXTENSIONS More terms from Farideh Firoozbakht, May 12 2005 First term from Eric M. Schmidt, Feb 05 2013 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 16 19:11 EST 2018. Contains 318188 sequences. (Running on oeis4.)