login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 3
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 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

The old entry with this sequence number was a duplicate of A056594.

PROG

(PARI) isA074661(n) = if(n<4, 0, isprime(vecmax(factor(n)[, 2])))

CROSSREFS

Cf. A096432, A060476.

Sequence in context: A102211 A119025 A167903 * A082293 A048944 A071835

Adjacent sequences:  A074658 A074659 A074660 * A074662 A074663 A074664

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Sep 18 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 00:21 EST 2012. Contains 205567 sequences.