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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A122601 a(n)=(n-th prime +1) modulo 7. 1
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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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.

LINKS

Table of n, a(n) for n=1..105.

FORMULA

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

MATHEMATICA

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

CROSSREFS

Cf. A039705.

Sequence in context: A021293 A275979 A246859 * A125776 A066977 A007551

Adjacent sequences:  A122598 A122599 A122600 * A122602 A122603 A122604

KEYWORD

nonn

AUTHOR

Zak Seidov, Sep 24 2006

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 5 18:16 EDT 2021. Contains 343572 sequences. (Running on oeis4.)