login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A074661
Let n = 2^e_2 * 3^e_3 * 5^e_5 * ... be the prime factorization of n; sequence gives n such that max{e_2, e_3, ...} is prime.
7
4, 8, 9, 12, 18, 20, 24, 25, 27, 28, 32, 36, 40, 44, 45, 49, 50, 52, 54, 56, 60, 63, 68, 72, 75, 76, 84, 88, 90, 92, 96, 98, 99, 100, 104, 108, 116, 117, 120, 121, 124, 125, 126, 128, 132, 135, 136, 140, 147, 148, 150, 152, 153, 156, 160, 164, 168, 169, 171, 172, 175, 180, 184
OFFSET
1,1
COMMENTS
The old entry with this sequence number was a duplicate of A056594.
The largest exponent of the prime factors of n is prime. - Harvey P. Dale, Mar 09 2012
The asymptotic density of this sequence is Sum_{p prime} (1/zeta(p+1) - 1/zeta(p)) = 0.3391101054... - Amiram Eldar, Oct 18 2020
LINKS
MATHEMATICA
Select[Range[200], PrimeQ[Max[Transpose[FactorInteger[#]][[2]]]]&] (* Harvey P. Dale, Mar 09 2012 *)
PROG
(PARI) isA074661(n) = if(n<4, 0, isprime(vecmax(factor(n)[, 2])))
CROSSREFS
Sequence in context: A319302 A119025 A167903 * A370076 A252849 A375229
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Sep 18 2008
STATUS
approved