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!)
A085629 Let b(n) equal the product of the exponents in the prime factorization of n. Then a(n) gives the least k such that b(k) = n. 3
1, 4, 8, 16, 32, 64, 128, 144, 216, 288, 2048, 432, 8192, 1152, 864, 1296, 131072, 1728, 524288, 2592, 3456, 18432, 8388608, 5184, 7776, 73728, 13824, 10368, 536870912, 15552, 2147483648, 20736, 55296, 1179648, 31104, 41472, 137438953472, 4718592 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

a(n) <= 2^n. - Robert G. Wilson v, Jul 14 2014

a(n) = 2^n iff n is a prime or n equals 4 or 6. - Robert G. Wilson v, Jul 19 2014

LINKS

Robert G. Wilson v, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)

MATHEMATICA

f[n_, i_] := f[n, i] = Block[{d, b, p, x}, p = Prime[i]; b = p^n; d = Divisors[n]; For[j = Length[d], j > 1, j--, x = d[[j]]; b = Min[b, p^x*f[n/x, i + 1]]]; b]; f[1, 1] = 1; Array[ f[#, 1] &, 42] (* Robert G. Wilson v, Jul 17 2014, after David Wasserman's PARI program below *)

PROG

(PARI) f(n, i) = local(d, best, p, x); p = prime(i); best = p^n; d = divisors(n); for (j = 2, length(d) - 1, x = d[j]; best = min(best, p^x*f(n/x, i + 1))); best; a(n) = f(n, 1) \\ David Wasserman, Feb 07 2005

CROSSREFS

Cf. A005361, A005934.

Cf. A005179.

Sequence in context: A111073 A298807 A005934 * A307870 A233442 A046055

Adjacent sequences:  A085626 A085627 A085628 * A085630 A085631 A085632

KEYWORD

nonn

AUTHOR

Jason Earls, Jul 10 2003

EXTENSIONS

More terms from David Wasserman, Feb 07 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 April 1 02:00 EDT 2020. Contains 333153 sequences. (Running on oeis4.)