login
A328630
a(n) is the number of prime factors in A328624(n), counted with multiplicity.
3
0, 1, 1, 3, 2, 2, 1, 2, 3, 5, 5, 5, 2, 3, 5, 7, 3, 3, 3, 4, 2, 4, 6, 6, 4, 5, 4, 6, 4, 4, 1, 2, 2, 4, 3, 3, 3, 4, 5, 7, 7, 7, 5, 6, 8, 10, 6, 6, 7, 8, 6, 8, 10, 10, 9, 10, 9, 11, 9, 9, 2, 3, 3, 5, 4, 4, 5, 6, 7, 9, 9, 9, 8, 9, 11, 13, 9, 9, 4, 5, 3, 5, 7, 7, 7, 8, 7, 9, 7, 7, 3, 4, 4, 6, 5, 5, 7, 8, 9, 11, 11, 11, 4, 5, 7, 9
OFFSET
0,4
FORMULA
a(n) = A001222(A328624(n)).
a(n) = A276150(A328625(n)).
PROG
(PARI)
A328624(n) = { my(m=1, p=2, e, g=1); while(n, e = (n%p); m *= (p^((g*e)%p)); g = e+1; n = n\p; p = nextprime(1+p)); (m); };
A328630(n) = bigomega(A328624(n));
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Oct 25 2019
STATUS
approved