A358217 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A358217

Number of prime factors (with multiplicity) in A319627(n).

0, 0, 1, 0, 1, 0, 1, 0, 2, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 2, 1, 1, 0, 2, 1, 3, 1, 1, 0, 1, 0, 2, 1, 1, 0, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 0, 2, 2, 2, 1, 1, 2, 2, 1, 2, 1, 1, 0, 1, 1, 3, 0, 2, 1, 1, 1, 2, 1, 1, 0, 1, 1, 2, 1, 1, 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, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 1, 3, 1, 2, 0

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,9

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..65537

Index entries for sequences related to primorial numbers

FORMULA

a(n) = A001222(A319627(n)).

Apparently, a(n) <= A358218(n) for all n.

PROG

(PARI)

A064989(n) = {my(f); f = factor(n); if((n>1 && f[1, 1]==2), f[1, 2] = 0); for (i=1, #f~, f[i, 1] = precprime(f[i, 1]-1)); factorback(f)};