The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A067785 Numbers k such that prime(k)^3 == prime(k+1)^3 (mod k). 1
 1, 2, 4, 7, 9, 18, 26, 79, 139, 219, 248, 657, 1505, 11246, 19999, 62608, 368172, 553598, 646926, 1241426, 1562457, 1568558, 5098990, 7889727, 12866334, 18941415, 24647857, 25355582, 25869571, 26114278, 40784906, 46699276, 53532458, 113309714, 230702738, 290702470 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(17) > 10^5. - Michel Marcus, Nov 22 2013 LINKS PROG (PARI) isok(n) = Mod(prime(n+1), n)^3 == Mod(prime(n), n)^3; \\ Michel Marcus, Nov 22 2013 CROSSREFS Cf. A030078. Sequence in context: A333317 A153776 A005625 * A059186 A034702 A325745 Adjacent sequences:  A067782 A067783 A067784 * A067786 A067787 A067788 KEYWORD nonn AUTHOR Benoit Cloitre, Feb 06 2002 EXTENSIONS a(16) from Michel Marcus, Nov 22 2013 More terms from Jinyuan Wang, Apr 06 2020 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 January 18 19:59 EST 2021. Contains 340262 sequences. (Running on oeis4.)