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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A303975 Number of distinct prime factors in the product of prime indices of n. 36
0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 2, 1, 2, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 0, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 2, 1, 2, 2, 1, 1, 0, 2, 2, 1, 1, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 1, 1, 1, 1, 1, 2, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,13
COMMENTS
A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.
First appearance of n is A062447(n - 1).
LINKS
FORMULA
a(n) = A001221(A156061(n)). - Michel Marcus, Jan 01 2019
EXAMPLE
9193 has prime indices {10, 66} with product 660, which has 4 distinct prime factors {2, 3, 5, 11}, so a(9193) = 4.
MATHEMATICA
Table[PrimeNu[If[n==1, 1, Times@@PrimePi/@First/@FactorInteger[n]]], {n, 100}]
PROG
(PARI) a(n) = my(v = factor(n)[, 1]); omega(prod(i = 1, #v, primepi(v[i]))) \\ David A. Corneth, Dec 29 2018
CROSSREFS
Sequence in context: A368734 A120728 A092149 * A171099 A337253 A127173
KEYWORD
nonn
AUTHOR
Gus Wiseman, Dec 28 2018
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 13:40 EDT 2024. Contains 371792 sequences. (Running on oeis4.)