|
Search: id:A006512
|
|
|
| A006512 |
|
Greater of twin primes.
(Formerly M3763)
|
|
+0
136
|
|
| 5, 7, 13, 19, 31, 43, 61, 73, 103, 109, 139, 151, 181, 193, 199, 229, 241, 271, 283, 313, 349, 421, 433, 463, 523, 571, 601, 619, 643, 661, 811, 823, 829, 859, 883, 1021, 1033, 1051, 1063, 1093, 1153, 1231, 1279, 1291, 1303, 1321, 1429, 1453, 1483, 1489, 1609
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Also primes that are the sum of two primes. - Cino Hilliard (hillcino368(AT)gmail.com), Jul 02 2004
The set of greater of twin primes larger than five is a proper subset of the set of primes of the form 3n + 1 (A002476). - Paul Muljadi (paulmuljadi(AT)yahoo.com), Jun 05 2008
Smallest prime>nth isolated composite. [From Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Nov 07 2009]
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
See A001359 for references and links.
Harvey Dubner, Twin Prime Statistics, Journal of Integer Sequences, Vol. 8 (2005), Article 05.4.2.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..10000
Index entries for primes, gaps between
O. E. Pol, Determinacion geometrica de los numeros primos y perfectos.
|
|
MAPLE
|
ZL:=[]:for p from 1 to 1610 do if (isprime(p) and isprime(p+2) ) then ZL:=[op(ZL), (binomial((p+2), p+1))]; fi; od; print(ZL); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 08 2007
for i from 1 to 253 do if ithprime(i+1) = ithprime(i) + 2 then print({ithprime(i+1)}); fi; od; - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 19 2007
|
|
MATHEMATICA
|
Select[ Prime[ Range[254]], PrimeQ[ # - 2] &] (from Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 09 2005)
|
|
CROSSREFS
|
Cf. A001359, A014574, A067829.
Bisection of A077800.
Subsequence of A139690.
Cf. A002476.
Sequence in context: A099349 A167464 A106986 this_sequence A074304 A072677 A063910
Adjacent sequences: A006509 A006510 A006511 this_sequence A006513 A006514 A006515
|
|
KEYWORD
|
nonn,nice,easy,new
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Dec 04 2000
|
|
|
Search completed in 0.006 seconds
|
