A358218 Number of prime factors (with multiplicity) in A328478(n).

0, 0, 1, 0, 1, 0, 1, 0, 2, 1, 1, 0, 1, 1, 2, 0, 1, 1, 1, 1, 2, 1, 1, 0, 2, 1, 3, 1, 1, 0, 1, 0, 2, 1, 2, 0, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 0, 2, 2, 2, 1, 1, 2, 2, 1, 2, 1, 1, 0, 1, 1, 3, 0, 2, 1, 1, 1, 2, 2, 1, 0, 1, 1, 3, 1, 2, 1, 1, 1, 4, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 0, 1, 2, 3, 2, 1, 1, 1, 1, 3, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 1, 3, 1, 2, 0

Offset: 1

Author

Antti Karttunen, Nov 04 2022

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 1..65537
• Index entries for sequences related to primorial numbers

Crossrefs

Cf. A001222, A025487 (positions of zeros), A328478, A355930.

Cf. A358219 (positions where differs from A358217).

Programs

PARI

A111701(n) = forprime(p=2, , if(n%p, return(n), n /= p));
A328478(n) = { my(u=A111701(n)); if(u==n, return(n), return(A328478(u))); };
A358218(n) = bigomega(A328478(n));

Formula

a(n) = A001222(A328478(n)).

a(n) <= A355930(n).

Apparently, a(n) >= A358217(n) for all n.