LINKS
Charlie Neder, <a href="/A052202/b052202_1.txt">Table of n, a(n) for n = 1..1000</a>
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A052202
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
Numbers k such that the product of the logarithms of k's prime factors is greater than their sum.
(history; published version)
(history; published version)
STATUS
editing
approved
COMMENTS
Previous name was: If p^a(p,n) is highest power of p that divides n, then productProduct_(p=primes) [log(p)^a(p,n) ] > log(n).
STATUS
proposed
editing
STATUS
editing
proposed
COMMENTS
Previous name was: If p^a(p,n) is highest power of p that divides n, then product(p=primes)[log(p)^a(p,n) ] > log(n).
Old title: If p^a(p,n) is highest power of p that divides n, then product(p=primes)[log(p)^a(p,n) ] > log(n).
STATUS
proposed
editing
STATUS
editing
proposed
NAME
If p^a(p,n) is highest power of p that divides n, then Product_(p=primes) log(p)^a(p,n) > log(n).
Numbers k such that the product of the logarithms of k's prime factors is greater than their sum.
COMMENTS
Numbers n such that the product of the logs of n's prime factors is greater than their sum.
Primes are counted with multiplicity.
Old title: If p^a(p,n) is highest power of p that divides n, then product(p=primes)[log(p)^a(p,n) ] > log(n).
EXTENSIONS
Title changed by Charlie Neder, Dec 04 2018
OFFSET
0,1,1
COMMENTS
a(100000) = 189837189835. (End)
LINKS
Charlie Neder, <a href="/A052202/b052202_1.txt">Table of n, a(n) for n = 01..9991000</a>
STATUS
proposed
editing
STATUS
editing
proposed
PROG
(PARI) isok(n) = my(f=factor(n)); prod(k=1, #f~, log(f[k, 1])^f[k, 2]) > log(n); \\ Michel Marcus, Dec 04 2018
STATUS
proposed
editing