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!)
 A261806 a(n) = Sum from "least x such that prime(x) has n digits" to "the number of primes with n digits" of the difference between prime(k) and k. 2
 7, 474, 42311, 3558614, 300169143, 25814402881 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA a(n) = Sum_{k=A090226(n)..A006879(n)} prime(k)-k EXAMPLE As 2, 3, 5, and 7 are the only primes less than 10, A006879(1) = 4 and as 1 is the least number such that prime(1) has 1 digit, A090226(1) = 1. Therefore a(1) = Sum_{k=1..4} prime(k)-k = (2-1) + (3-2) + (5-3) + (7-4) = 1 + 1 + 2 + 3 = 7. CROSSREFS Cf. A006879, A014689, A090226. Sequence in context: A238164 A112949 A254966 * A332147 A278143 A119621 Adjacent sequences:  A261803 A261804 A261805 * A261807 A261808 A261809 KEYWORD nonn,base,more AUTHOR Carauleanu Marc, Jul 09 2016 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 July 5 21:00 EDT 2020. Contains 335473 sequences. (Running on oeis4.)