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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A186524 Numbers n such that n == prime(n) (mod 7). 0

%I #8 Mar 12 2015 23:34:42

%S 6,9,13,17,34,40,48,51,62,72,73,79,80,86,100,102,109,113,116,120,134,

%T 139,142,146,162,165,169,180,183,194,198,202,206,219,228,229,239,248,

%U 249,255,267,270,271,285,288,291,295,299,300,310,312,330,331

%N Numbers n such that n == prime(n) (mod 7).

%e 6 and 13, the 6th prime, are equal (mod 7).

%t Select[Range[1000],Mod[#,7] == Mod[Prime[#],7]&]

%K nonn

%O 1,1

%A _Zak Seidov_, Feb 23 2011

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 6 09:14 EDT 2024. Contains 375712 sequences. (Running on oeis4.)