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!)
 A159686 Sum of strong primes < 10^n. 0
 0, 508, 33551, 2751328, 216056493, 18084221125, 1548424793743, 135655041210402, 12054551765023934, 1084635554912125542 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS The number of strong primes < n ~ sum of strong primes < sqrt(n). For number of strong primes < 10^11 = 2014200162 and the sum of strong primes < 10^5.5 = 1972716560, for an error of 0.0206 LINKS Cino Hilliard, Sum of Strong Primes FORMULA Given 3 consecutive primes p1,p2,p3, p2 is a strong prime if p2 > (p1+p2)/2. Or, primes that are greater than the arithmetic mean of their immediate surrounding primes. EXAMPLE The strong primes < 10^2 are 11, 17, 29, 37, 41, 59, 67, 71, 79, 97. These add up to 508 which is the second term in the sequence. CROSSREFS Sequence in context: A152524 A236004 A024019 * A198195 A142819 A183058 Adjacent sequences:  A159683 A159684 A159685 * A159687 A159688 A159689 KEYWORD nonn AUTHOR Cino Hilliard, Apr 19 2009 EXTENSIONS Edited by N. J. A. Sloane, Apr 20 2009 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 September 23 16:01 EDT 2020. Contains 337310 sequences. (Running on oeis4.)