# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/
Search: id:a068670
Showing 1-1 of 1
%I A068670 #53 Feb 03 2023 14:58:30
%S A068670 0,1,2,3,4,6,8,10,12,14,16,18,20,22,24,26,28,30,32,34,36,38,40,42,44,
%T A068670 46,49,52,55,58,61,64,67,70,73,76,79,82,85,88,91,94,97,100,103,106,
%U A068670 109,112,115,118,121,124,127,130,133,136,139,142,145,148,151,154
%N A068670 Number of digits in the concatenation of first n primes.
%C A068670 Partial sums of A097944. - _Lekraj Beedassy_, Aug 26 2008
%H A068670 Charles R Greathouse IV, Table of n, a(n) for n = 0..10000. (Initial 0 added by _M. F. Hasler_, Nov 02 2019.)
%H A068670 Eric Weisstein's World of Mathematics, Copeland-Erdos Constant
%F A068670 a(n) = Sum_{i=1..n} ceiling(log_10(1 + prime(i))). - _Daniel Forgues_, Apr 02 2014
%e A068670 a(5) is 6 because concatenating the first five primes gives 235711, which has six digits.
%t A068670 Table[n + Sum[Floor[Log[10, Prime[k]]], {k, 1, n}], {n, 1, 90}] (* Joseph Biberstine (jrbibers(AT)indiana.edu), Aug 12 2006 *)
%t A068670 Accumulate[IntegerLength[Prime[Range[70]]]] (* _Harvey P. Dale_, Jul 01 2012 *)
%o A068670 (Magma) a068670:=func< n | n + &+[ Floor(Log(10, NthPrime(k))): k in [1..n] ] >; [ a068670(n): n in [1..70] ];
%o A068670 (PARI) A68670=List(0); A068670(n)={for(N=#A68670,n, listput(A68670, A68670[N] + A097944(N))); A68670[n+1]} \\ _M. F. Hasler_, Oct 24 2019
%o A068670 (Python)
%o A068670 from sympy import sieve
%o A068670 from itertools import accumulate, chain
%o A068670 def f(_, n): return _ + len(str(n))
%o A068670 def agen(): yield from accumulate(chain((0,), (p for p in sieve)), f)
%o A068670 print(list(islice(agen(), 62))) # _Michael S. Branicky_, Feb 03 2023
%Y A068670 Cf. A019518, A097944 (number of decimal digits of the primes).
%Y A068670 Cf. A033308 (decimal expansion of the Copeland-Erdos constant).
%K A068670 nonn,base
%O A068670 0,3
%A A068670 Eugene McDonnell (eemcd(AT)mac.com), Jan 18 2004
%E A068670 Extended to a(0) = 0 by _M. F. Hasler_, Oct 24 2019
# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE