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!)
A067185 Numbers n such that prime(n+1)+prime(n)==1 (mod n). 3
1, 7, 17, 109, 281, 1669, 6592663, 16899113, 16899145, 16899295, 749973611, 5067034877, 5067034925, 34487825911, 1626582230375 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

MATHEMATICA

a = b = 0; Do[b = Prime[n + 1]; If[Mod[a + b, n] == 1, Print[n]]; a = b, {n, 1, 10^9}]

PROG

(Sage)

def A067185(max):

    terms = []

    p = 2

    for n in range(1, max + 1):

        q = next_prime(p)

        if not (p + q - 1) % n:

            terms.append(n)

        p = q

    return terms

# Eric M. Schmidt, Feb 05 2013

CROSSREFS

Sequence in context: A181605 A284209 A068172 * A205989 A262474 A284416

Adjacent sequences:  A067182 A067183 A067184 * A067186 A067187 A067188

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Feb 19 2002

EXTENSIONS

Edited and extended by Robert G. Wilson v, Feb 19 2002

Extended by David W. Wilson, Feb 20 2002

a(11)-a(14) from Donovan Johnson, Mar 10 2010

First term from Eric M. Schmidt, Feb 05 2013

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 August 4 14:11 EDT 2020. Contains 336201 sequences. (Running on oeis4.)