login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A334933
a(n) = Product_{p|n, p<n} omega(n/p).
0
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 8, 1, 1, 1, 1, 1, 4, 1, 1, 1, 2, 1, 8, 1, 2, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 12, 1, 1, 2, 1, 1, 8, 1, 2, 1, 8, 1, 4, 1, 1, 2, 2, 1, 8, 1, 2, 1, 1, 1, 12, 1, 1, 1, 2, 1, 12, 1, 2, 1
OFFSET
1,12
FORMULA
If n > 1 is squarefree and composite, then a(n) = (omega(n)-1)^omega(n).
If n = p^k where p is prime and k is a nonnegative integer, then a(n) = 1.
MATHEMATICA
Table[Product[PrimeNu[n/i]^((PrimePi[i] - PrimePi[i - 1])*(1 - Ceiling[n/i] + Floor[n/i])), {i, n - 1}], {n, 100}]
PROG
(PARI) a(n) = my(f=factor(n)[, 1]); prod(k=1, #f~, if (f[k] < n, omega(n/f[k]), 1)); \\ Michel Marcus, Jun 09 2020
CROSSREFS
Cf. A001221 (omega).
Sequence in context: A355382 A304779 A361691 * A371451 A049100 A276088
KEYWORD
nonn,easy
AUTHOR
Wesley Ivan Hurt, Jun 09 2020
STATUS
approved