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!)
A122601 a(n)=(n-th prime +1) modulo 7. 1

%I #3 Jul 12 2012 00:39:49

%S 3,4,6,1,5,0,4,6,3,2,4,3,0,2,6,5,4,6,5,2,4,3,0,6,0,4,6,3,5,2,2,6,5,0,

%T 3,5,4,3,0,6,5,0,3,5,2,4,2,0,4,6,3,2,4,0,6,5,4,6,5,2,4,0,0,4,6,3,3,2,

%U 5,0,4,3,4,3,2,6,5,6,3,4,0,2,5,0,6,3,2,3,0,2,6,4,5,2,3,0,6,4,6,3,2,5,4,3,5

%N a(n)=(n-th prime +1) modulo 7.

%C a(n)=1 only for n=4; frequences f(m) of other values are almost equal, e.g., for n=1..1000, f(m=0..6): 166,1,165,166,168,164,170.

%F a(n)= (A039705(n)+1) mod 7

%t Table[Mod[(Prime[n]+1),7],{n,1000}]

%Y Cf. A039705.

%K nonn

%O 1,1

%A _Zak Seidov_, Sep 24 2006

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 April 25 11:29 EDT 2024. Contains 371967 sequences. (Running on oeis4.)