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!)
A209202 Values of the difference d for 3 primes in geometric-arithmetic progression with the minimal sequence {3*3^j + j*d}, j = 0 to 2. 10
2, 8, 10, 20, 22, 28, 38, 50, 52, 62, 70, 92, 98, 100, 118, 122, 128, 140, 142, 170, 202, 218, 220, 230, 232, 248, 260, 268, 272, 302, 308, 328, 350, 358, 380, 392, 400, 430, 440, 470, 478, 482, 512, 532, 538, 548, 562, 568, 598, 632, 638, 650, 700, 710, 730 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
A geometric-arithmetic progression of primes is a set of k primes (denoted by GAP-k) of the form p r^j + j d for fixed p, r and d and consecutive j. Symbolically, for r = 1, this sequence simplifies to the familiar primes in arithmetic progression (denoted by AP-k). The computations were done without any assumptions on the form of d. Primality requires d to be even and coprime to 3.
LINKS
Sameen Ahmed Khan, Primes in Geometric-Arithmetic Progression, arXiv:1203.2083v1 [math.NT], (Mar 09 2012).
EXAMPLE
d = 8 then {3*3^j + j*d}, j = 0 to 2, is {3, 17, 43}, which is 3 primes in geometric-arithmetic progression.
MATHEMATICA
p = 3; gapset3d = {}; Do[If[PrimeQ[{p, p*p + d, p*p^2 + 2*d}] == {True, True, True}, AppendTo[gapset3d, d]], {d, 0, 1000, 2}]; gapset3d
CROSSREFS
Sequence in context: A082396 A195582 A071388 * A032356 A114272 A193266
KEYWORD
nonn
AUTHOR
Sameen Ahmed Khan, Mar 06 2012
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 16 03:14 EDT 2024. Contains 372549 sequences. (Running on oeis4.)