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.

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.

Terms

    a(0) =1a(1) =4a(2) =8a(3) =16a(4) =32a(5) =64a(6) =128a(7) =144a(8) =216a(9) =288a(10) =2048a(11) =432a(12) =8192a(13) =1152a(14) =864a(15) =1296a(16) =131072a(17) =1728a(18) =524288a(19) =2592a(20) =3456a(21) =18432a(22) =8388608a(23) =5184a(24) =7776a(25) =73728a(26) =13824a(27) =10368a(28) =536870912a(29) =15552

External references