|
|
A067175
|
|
Number of digits in the n-th primorial (A002110).
|
|
2
|
|
|
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, 39, 41, 43, 45, 47, 49, 51, 53, 56, 58, 60, 62, 64, 66, 69, 71, 73, 76, 78, 80, 82, 85, 87, 89, 92, 94, 97, 99, 101, 104, 106, 109, 111, 113, 116, 118, 121, 123, 126, 128, 131, 133
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
LINKS
|
|
|
MAPLE
|
with(numtheory): it := 1: for n from 1 to 150 do it := it*ithprime(n): printf(`%d, `, ceil(log[10](it))) od:
|
|
MATHEMATICA
|
Table[Floor[Log[10, Product[Prime[k], {k, n}]] + 1], {n, 0, 67}]
Join[{1}, IntegerLength/@FoldList[Times, Prime[Range[70]]]] (* Harvey P. Dale, Jan 03 2024 *)
|
|
PROG
|
(PARI) a(n) = 1 + logint(vecprod(primes(n)), 10) \\ Andrew Howroyd, Apr 24 2021
(Python)
from sympy import primorial
def a(n): return 1 if n == 0 else len(str(primorial(n)))
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|