This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A067175 #32 Aug 22 2025 17:39:06
%S A067175 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 A067175 39,41,43,45,47,49,51,53,56,58,60,62,64,66,69,71,73,76,78,80,82,85,87,
%U A067175 89,92,94,97,99,101,104,106,109,111,113,116,118,121,123,126,128,131,133
%N A067175 Number of digits in the n-th primorial (A002110).
%H A067175 Alois P. Heinz, <a href="/A067175/b067175.txt">Table of n, a(n) for n = 0..10000</a> (first 5001 terms from Soumyadeep Dhar)
%p A067175 with(numtheory): it := 1: for n from 1 to 150 do it := it*ithprime(n): printf(`%d,`,ceil(log[10](it))) od:
%t A067175 Table[Floor[Log[10, Product[Prime[k], {k, n}]] + 1], {n, 0, 67}]
%t A067175 Join[{1},IntegerLength/@FoldList[Times,Prime[Range[70]]]] (* _Harvey P. Dale_, Jan 03 2024 *)
%o A067175 (PARI) a(n) = 1 + logint(vecprod(primes(n)), 10) \\ _Andrew Howroyd_, Apr 24 2021
%o A067175 (Python)
%o A067175 from sympy import primorial
%o A067175 def a(n): return 1 if n == 0 else len(str(primorial(n)))
%o A067175 print([a(n) for n in range(68)]) # _Michael S. Branicky_, Apr 24 2021
%Y A067175 Cf. A002110. Essentially the same as A048856.
%Y A067175 Cf. A004216, A004218, A055642, A387173.
%K A067175 base,nonn,changed
%O A067175 0,4
%A A067175 _Lekraj Beedassy_, Feb 18 2002
%E A067175 Edited and extended by _Robert G. Wilson v_ and _James Sellers_, Feb 19 2002
%E A067175 Offset corrected by _Arkadiusz Wesolowski_, May 04 2013