This site is supported by donations to The OEIS Foundation.
Greatest prime factor of n
From OeisWiki
(Redirected from Gpf(n))
n |
n |
The density of positive integers with greatest prime factor prime (n) is zero, and is equal to the density of prime (n)-smooth numbers minus the density of prime (n − 1)-smooth numbers, which are both equal to zero.
Sequences
A006530 Largest noncomposite dividingn, n ≥ 1 |
n, n ≥ 2 |
- {1, 2, 3, 2, 5, 3, 7, 2, 3, 5, 11, 3, 13, 7, 5, 2, 17, 3, 19, 5, 7, 11, 23, 3, 5, 13, 3, 7, 29, 5, 31, 2, 11, 17, 7, 3, 37, 19, 13, 5, 41, 7, 43, 11, 5, 23, 47, 3, 7, 5, 17, 13, 53, 3, 11, 7, 19, ...}
See also
- p-smooth numbers
- Largest prime dividing n
- A006530 Gpf (n): greatest prime factor of n (greatest prime dividing n), with
.a (1) = 1
- p-rough numbers
- Smallest prime dividing n
- A020639 Lpf (n): least prime factor of n (least prime dividing n), with
.a (1) = 1