login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A112537 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) = b(n)^c(n+1). 1
1, 2, 9, 2, 5, 6, 343, 4, 3, 10, 11, 12, 13, 14, 50625, 2, 17, 18, 19, 20, 21, 22, 23, 576, 5, 17576, 3, 28, 29, 30, 28629151, 2, 33, 34, 1225, 6, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 2304, 7, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 62523502209, 2, 65, 66 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..66.

FORMULA

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

EXAMPLE

b(7) = 7, since 7 = 7^1. And c(8) = 3, since 8 = 2^3.

So a(7) = 7^3 = 343.

CROSSREFS

Cf. A052409, A052410.

Sequence in context: A217273 A188981 A277754 * A165715 A088928 A074957

Adjacent sequences:  A112534 A112535 A112536 * A112538 A112539 A112540

KEYWORD

nonn

AUTHOR

Leroy Quet, Dec 14 2005

EXTENSIONS

Extended by Ray Chandler, Dec 25 2005

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 26 18:30 EDT 2021. Contains 348268 sequences. (Running on oeis4.)