Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #24 Jan 03 2024 08:18:24
%S 1,1,1,2,3,4,5,6,7,9,10,12,13,15,17,18,20,22,24,25,27,29,31,33,35,37,
%T 39,41,43,45,47,49,51,53,56,58,60,62,64,66,69,71,73,76,78,80,82,85,87,
%U 89,92,94,97,99,101,104,106,109,111,113,116,118,121,123,126,128,131,133
%N Number of digits in the n-th primorial (A002110).
%H Soumyadeep Dhar, <a href="/A067175/b067175.txt">Table of n, a(n) for n = 0..5000</a>
%p with(numtheory): it := 1: for n from 1 to 150 do it := it*ithprime(n): printf(`%d,`,ceil(log[10](it))) od:
%t Table[Floor[Log[10, Product[Prime[k], {k, n}]] + 1], {n, 0, 67}]
%t Join[{1},IntegerLength/@FoldList[Times,Prime[Range[70]]]] (* _Harvey P. Dale_, Jan 03 2024 *)
%o (PARI) a(n) = 1 + logint(vecprod(primes(n)), 10) \\ _Andrew Howroyd_, Apr 24 2021
%o (Python)
%o from sympy import primorial
%o def a(n): return 1 if n == 0 else len(str(primorial(n)))
%o print([a(n) for n in range(68)]) # _Michael S. Branicky_, Apr 24 2021
%Y Cf. A002110. Essentially the same as A048856.
%Y Cf. A004216, A004218, A055642.
%K base,nonn
%O 0,4
%A _Lekraj Beedassy_, Feb 18 2002
%E Edited and extended by _Robert G. Wilson v_ and _James A. Sellers_, Feb 19 2002
%E Offset corrected by _Arkadiusz Wesolowski_, May 04 2013