cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A325225 Lesser of the number of prime factors of n counted with multiplicity and the maximum prime index of n.

Original entry on oeis.org

0, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 2, 2, 1, 1, 2, 1, 3, 2, 2, 1, 2, 2, 2, 2, 3, 1, 3, 1, 1, 2, 2, 2, 2, 1, 2, 2, 3, 1, 3, 1, 3, 3, 2, 1, 2, 2, 3, 2, 3, 1, 2, 2, 4, 2, 2, 1, 3, 1, 2, 3, 1, 2, 3, 1, 3, 2, 3, 1, 2, 1, 2, 3, 3, 2, 3, 1, 3, 2, 2, 1, 4, 2, 2, 2, 4, 1, 3, 2, 3, 2, 2, 2, 2, 1, 3, 3, 3, 1, 3, 1, 4, 3
Offset: 1

Views

Author

Gus Wiseman, Apr 12 2019

Keywords

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.

Examples

			88 has 4 prime indices {1,1,1,5}, the maximum of which is 5, so a(88) = min(4,5) = 4.
		

Crossrefs

Positions of 1's are A174090. Positions of 2's are A325229.

Programs

  • Mathematica
    Table[Min[PrimeOmega[n],PrimePi[FactorInteger[n][[-1,1]]]],{n,100}]
  • PARI
    A061395(n) = if(1==n, 0, primepi(vecmax(factor(n)[, 1])));
    A325225(n) = min(bigomega(n), A061395(n)); \\ Antti Karttunen, Apr 14 2019

Formula

a(n) = min(A001222(n), A061395(n)).

Extensions

More terms from Antti Karttunen, Apr 14 2019