The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A268879 a(n) is the least prime p=prime(m) such that gcd (prime(m) + 2, prime(m + 1) + 2) = 2*n - 1. 1
2, 31, 283, 2357, 1069, 8017, 16703, 7963, 88177, 39461, 129127, 101221, 452873, 153763, 525043, 473027, 283303, 1714963, 949307, 736279, 1232089, 7865171, 1138273, 20167369, 14402813, 12501067, 1098847, 3240983 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n) = prime(A268863(n)) = A000040(A268863(n)).
EXAMPLE
See A268863.
CROSSREFS
Sequence in context: A188225 A164676 A004307 * A120357 A333935 A152278
KEYWORD
nonn
AUTHOR
Zak Seidov, Feb 15 2016
STATUS
approved

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 May 23 18:34 EDT 2024. Contains 372765 sequences. (Running on oeis4.)