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!)
A159686 Sum of strong primes < 10^n. 0

%I #6 Oct 01 2013 21:35:29

%S 0,508,33551,2751328,216056493,18084221125,1548424793743,

%T 135655041210402,12054551765023934,1084635554912125542

%N Sum of strong primes < 10^n.

%C 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

%H Cino Hilliard, <a href="http://groups.google.com/group/sumprimes/web/count-and-sum-strong-primes?msg=sap">Sum of Strong Primes</a>

%F Given 3 consecutive primes p1,p2,p3, p2 is a strong prime if p2 > (p1+p2)/2.

%F Or, primes that are greater than the arithmetic mean of their immediate surrounding primes.

%e 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.

%K nonn

%O 1,2

%A _Cino Hilliard_, Apr 19 2009

%E Edited by _N. J. A. Sloane_, Apr 20 2009

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 April 24 12:51 EDT 2024. Contains 371943 sequences. (Running on oeis4.)