A112538 - OEIS

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A112538

If b(n) is the smallest positive integer and c(n) is the largest positive integer such that n = b(n)^c(n), then a(n) = c(n)^b(n).

1, 1, 4, 1, 1, 1, 9, 8, 1, 1, 1, 1, 1, 1, 16, 1, 1, 1, 1, 1, 1, 1, 1, 32, 1, 27, 1, 1, 1, 1, 25, 1, 1, 1, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1024

(list; graph; refs; listen; history; text; internal format)

OFFSET

2,3

LINKS

Michael De Vlieger, Table of n, a(n) for n = 2..10000

G. Kreweras, Sur les hiérarchies de segments, Cahiers du Bureau Universitaire de Recherche Opérationnelle, Institut de Statistique, Université de Paris, #20 (1973). (Annotated scanned copy)

FORMULA

a(n) = A052409(n)^A052410(n).

EXAMPLE

25 = 5^2, so a(25) = 2^5 = 32.

MATHEMATICA

Array[#2^If[#1 == 1, 1, #1^(1/#2)] & @@ {#, Apply[GCD, FactorInteger[#][[All, -1]]]} &, 99, 2] (* Michael De Vlieger, Nov 05 2017, after Ray Chandler at A052409 *)

CROSSREFS

Cf. A052409, A052410.

Sequence in context: A057521 A084885 A360969 * A008477 A303278 A222639

Adjacent sequences: A112535 A112536 A112537 * A112539 A112540 A112541

KEYWORD

nonn

AUTHOR

Leroy Quet, Dec 14 2005

EXTENSIONS

Extended by Ray Chandler, Dec 25 2005

STATUS

approved