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”).

A121067
a(n) = the n-th divisor of n^n (when the positive divisors of n^n are written in order from smallest to largest).
4
1, 2, 9, 8, 625, 8, 117649, 128, 6561, 32, 25937424601, 27, 23298085122481, 112, 375, 32768, 48661191875666868481, 72, 104127350297911241532841, 250, 2401, 1024, 907846434775996175406740561329, 162, 59604644775390625, 2704, 2541865828329
OFFSET
1,2
COMMENTS
This is also the n-th divisor of n^(n-1); any divisor with a factor of p^n is preceded by n smaller powers of p in the divisor list. [Franklin T. Adams-Watters, Sep 21 2009]
LINKS
Charlie Neder, Table of n, a(n) for n = 1..388 (first 180 terms from Alois P. Heinz)
FORMULA
a(n) <= A020639(n)^n, with equality for n a prime power. - Charlie Neder, Mar 06 2019
EXAMPLE
1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 32, 36, 48, 54, 64,... is the beginning of the sequence of divisors of 6^6 = 46656. 8 is the 6th term of this sequence of divisors (which is sequence A114334), so a(6) = 8.
MAPLE
a:= n-> sort([numtheory[divisors](n^(n-1))[]])[n]:
seq(a(n), n=1..30); # Alois P. Heinz, Oct 09 2016
MATHEMATICA
Table[Divisors[n^n][[n]], {n, 27}] (* Michael De Vlieger, Sep 19 2017 *)
PROG
(PARI) m=27; for(n=1, m, d=divisors(n^n); print1(d[n], ", ")) \\ Klaus Brockhaus, Aug 14 2006
(GAP) List([1..30], n->DivisorsInt(n^n)[n]); # Muniru A Asiru, Mar 06 2019
CROSSREFS
Cf. A000312.
Sequence in context: A191351 A324553 A230283 * A073904 A036879 A281389
KEYWORD
nonn
AUTHOR
Leroy Quet, Aug 10 2006
EXTENSIONS
More terms from Joshua Zucker, Klaus Brockhaus and Jason Earls, Aug 11 2006
STATUS
approved