|
|
A054988
|
|
Number of prime divisors of 1 + (product of first n primes), with multiplicity.
|
|
10
|
|
|
1, 1, 1, 1, 1, 2, 3, 2, 2, 3, 1, 3, 3, 2, 3, 4, 4, 2, 2, 4, 2, 3, 2, 4, 3, 2, 4, 4, 3, 3, 5, 3, 6, 2, 3, 2, 5, 4, 4, 2, 6, 3, 4, 3, 5, 6, 7, 2, 6, 3, 5, 3, 4, 2, 6, 5, 4, 5, 3, 5, 5, 5, 3, 3, 5, 5, 6, 3, 4, 4, 7, 5, 3, 4, 1, 2, 5, 5, 5, 4, 5, 3, 5, 4, 6, 5, 8
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
COMMENTS
|
Prime divisors are counted with multiplicity. - Harvey P. Dale, Oct 23 2020
It is an open question as to whether omega(p#+1) = bigomega(p#+1) = a(n); that is, as to whether the Euclid numbers are squarefree. Any square dividing p#+1 must exceed 2.5*10^15 (see Vardi, p. 87). - Sean A. Irvine, Oct 21 2023
|
|
REFERENCES
|
Ilan Vardi, Computational Recreations in Mathematica, Addison-Wesley, 1991.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(6)=2 because 2*3*5*7*11*13+1 = 30031 = 59 * 509.
|
|
MAPLE
|
numtheory[bigomega](1+mul(ithprime(i), i=1..n)) ;
end proc:
|
|
MATHEMATICA
|
a[q_] := Module[{x, n}, x=FactorInteger[Product[Table[Prime[i], {i, q}][[j]], {j, q}]+1]; n=Length[x]; Sum[Table[x[[i]][[2]], {i, n}][[j]], {j, n}]]
PrimeOmega[#+1]&/@FoldList[Times, Prime[Range[90]]] (* Harvey P. Dale, Oct 23 2020 *)
|
|
PROG
|
(PARI) a(n) = bigomega(1+prod(k=1, n, prime(k))); \\ Michel Marcus, Mar 07 2022
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard
|
|
AUTHOR
|
Arne Ring (arne.ring(AT)epost.de), May 30 2000
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|