|
Search: id:A061068
|
|
|
| A061068 |
|
Primes which are the sum of a smaller prime and its prime subscript. |
|
+0
17
|
|
| 3, 5, 11, 19, 79, 101, 113, 127, 163, 173, 223, 271, 383, 419, 431, 503, 571, 599, 619, 641, 659, 673, 683, 701, 733, 757, 827, 863, 971, 1013, 1033, 1087, 1193, 1249, 1423, 1433, 1453, 1483, 1579, 1621, 1667, 1723, 2003, 2113, 2179, 2287, 2381, 2459, 2467
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(n) = prime which is A061067(n) + A064402(n). - Leroy Quet Jun 30 2006
This sequence is the intersection of A014688 with the set of primes. Conjecture: this sequence is infinite, yet derives from arbitrarily long "prime deserts" such as the 11 composites in A014688 between a(6) = 19 and a(18) = 79 and the 17 composites in A014688 between a(48) = 271 and a(66) = 383. - Jonathan Vos Post (jvospost3(AT)gmail.com), Nov 22 2004
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
Leroy Quet, Home Page (listed in lieu of email address)
|
|
EXAMPLE
|
5th term is 69=61+18=prime(18)+18.
|
|
MATHEMATICA
|
Select[Range[500], PrimeQ[Prime[ # ] + # ] &] + Prime[Select[Range[500], PrimeQ[Prime[ # ] + # ] &]] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jul 21 2006
|
|
PROGRAM
|
(PARI) { n=0; m=0; forprime (p=2, 109567, if (isprime(p + m++), write("b061068.txt", n++, " ", p + m)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 17 2009]
|
|
CROSSREFS
|
Cf. A061067, A061067, A064402.
Sequence in context: A147189 A118744 A092672 this_sequence A058932 A118037 A094588
Adjacent sequences: A061065 A061066 A061067 this_sequence A061069 A061070 A061071
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), May 28 2001
|
|
EXTENSIONS
|
Edited by N. J. A. Sloane (njas(AT)research.att.com), Apr 29 2007
|
|
|
Search completed in 0.002 seconds
|
