|
Search: id:A152127
|
|
|
| A152127 |
|
Sum of cousin primes < 10^n. |
|
+0
1
|
|
| 28, 766, 325761706602, 1096399967379208796, 542100094312, 41248685420836, 3233516261489332, 260607555289408894, 21446383929686290726, 1795656778320649469818, 152541729206365604807782
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
"According to the first Hardy-Littlewood conjecture, the cousin primes have
the same asymptotic density as the twin primes." See link MathWorld. The (sum
of cousin prime pairs < 10^n)/4 ~ number of cousin primes < 10^2n.
|
|
LINKS
|
Cino Hilliard, Gcc Sum of cousin primes
MathWorld, Cousin Primes
|
|
FORMULA
|
Cousin primes are prime pairs that differ by 4. The convention here
is to count a cousin pair as long as the first cousin of the pair is less than
or equal to the specified bound which in this sequence is 10^n.
|
|
EXAMPLE
|
(3,7) and (7,11) are the cousin primes < 10. These add up to 28 the first
entry in the sequence.
|
|
CROSSREFS
|
Sequence in context: A012808 A097834 A063817 this_sequence A113532 A158545 A097311
Adjacent sequences: A152124 A152125 A152126 this_sequence A152128 A152129 A152130
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)hotmail.com), Nov 25 2008
|
|
|
Search completed in 0.002 seconds
|
