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!)
 A323734 a(n) is the largest number j whose n-th power has exactly j divisors. 5
 1, 2, 3, 40, 45, 1, 7, 225, 153, 640, 4851, 6348, 325, 19474560, 1, 976, 18513, 1225, 19, 107747640000, 81, 1, 23, 245790720, 49, 2601, 2133, 3025, 94221, 56241820800, 31, 20063232, 4225, 15262600, 4761, 19236456, 37, 25462407801600, 5929, 2952832000, 21921921 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS a(n) is the largest (and last) of the A323731(n) numbers in row n of A323730. If a(n)=1 then n is a term in A323732; otherwise, n is a term in A323733. LINKS Jon E. Schoenfield, Table of n, a(n) for n = 0..100 EXAMPLE The numbers j whose 3rd powers have exactly j divisors are 1, 28, and 40; the largest of these is 40, so a(3) = 40. The only number j whose 5th power has exactly j divisors is 1, so a(1) = 1. CROSSREFS Cf. A000005, A073049, A323730, A323731, A323732, A323733. Sequence in context: A076724 A080393 A111683 * A347817 A088984 A355843 Adjacent sequences: A323731 A323732 A323733 * A323735 A323736 A323737 KEYWORD nonn AUTHOR Jon E. Schoenfield, Jan 26 2019 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 3 08:35 EST 2022. Contains 358515 sequences. (Running on oeis4.)