The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A073049 Least m > 1 such that m^n has m divisors, or 0 if no such m exists. 7
 2, 3, 28, 5, 0, 7, 225, 153, 640, 11, 6348, 13, 19474560, 0, 976, 17, 1225, 19, 1521, 81, 0, 23, 343000, 49, 2601, 2133, 3025, 29, 1495296000, 31, 20063232, 4225, 15262600, 4761, 19236456, 37, 25462407801600, 5929, 34633600, 41, 0, 43, 7569, 356445, 8281 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Since a prime power p^k has exactly k+1 divisors, choosing k=p-1, where p is a prime, thus implies a(p-1)=p for any prime p. LINKS Jon E. Schoenfield, Table of n, a(n) for n = 1..100 CROSSREFS Cf. A000005, A323730. Sequence in context: A132533 A059089 A098812 * A349826 A279880 A279140 Adjacent sequences: A073046 A073047 A073048 * A073050 A073051 A073052 KEYWORD nice,nonn AUTHOR Lekraj Beedassy, Aug 31 2002 EXTENSIONS Definition and terms for n = 1, 13, 23, 29, 31, 33, 35, 37, 39, and 44 corrected by Jon E. Schoenfield, Apr 17 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 5 13:58 EST 2022. Contains 358588 sequences. (Running on oeis4.)