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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A231576 Sequence of pairs k,g such that k is the smallest odd number and k*2^n-1-g, k*2^n-1, k*2^n-1+g are three consecutive primes in arithmetic progression. 3
 3, 2, 53, 12, 33, 6, 69, 6, 19, 6, 2193, 12, 93, 6, 113, 6, 87, 6, 413, 12, 1165, 12, 143, 6, 237, 6, 47, 6, 315, 18, 779, 6, 631, 30, 797, 6, 735, 12, 567, 18, 397, 6, 351, 24, 195, 18, 39, 36, 2719, 6, 971, 6, 1369, 30, 635, 18, 1501, 12, 593, 72, 2053, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Pierre CAMI, Table of n, a(n) for n = 1..1300 Pierre CAMI, PFGW Script EXAMPLE 3*2^1-1-2=3, 3*2^1-1=5, 3*2^1-1+2=7, so first pair = 3,2 (the only one with g=2). 53*2^2-1-12=199, 53*2^2-1=211, 53*2^2-1+12=223, so second pair = 53,12. CROSSREFS Cf. A228452, A228454, A230699, A230852. Sequence in context: A331474 A093892 A104254 * A190286 A063513 A265635 Adjacent sequences:  A231573 A231574 A231575 * A231577 A231578 A231579 KEYWORD nonn AUTHOR Pierre CAMI, Nov 11 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.

Last modified August 4 13:38 EDT 2020. Contains 336201 sequences. (Running on oeis4.)