This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A143851 Primes p that divide the sum of their residues modulo all smaller primes (=A024934(p)). 3
 2, 13, 167, 2239, 439867, 724031017, 1990127567, 54892225873 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Also, primes p such that p divides A024924(p). The prime terms of A065132. LINKS EXAMPLE 13 is congruent to 1,1,3,6 and 2, modulo 2,3,5,7 and 11 respectively. 1+1+3+6+2=13, which is a multiple of the original number, 13. So the original number, is in the sequence. MATHEMATICA For[n = 1, n < 1000001, n++, p = Prime[n]; m = Mod[Sum[Mod[p, Prime[i]], {i, 1, n - 1}], p]; If[m == 0, Print[p]]] CROSSREFS Cf. A065132 Sequence in context: A132521 A177448 A078363 * A088316 A006905 A119400 Adjacent sequences:  A143848 A143849 A143850 * A143852 A143853 A143854 KEYWORD more,nonn AUTHOR Neil Fernandez, Sep 03 2008 EXTENSIONS a(6)-a(8) from Max Alekseyev, Feb 10 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .