a(n) is the least k such that e(k) = n, where e(k) is the smallest m > 1 such that k^m contains all the digits of k with at least the same multiplicity.

A239465

a(n) is the least k such that e(k) = n, where e(k) is the smallest m > 1 such that k^m contains all the digits of k with at least the same multiplicity.

Terms

    a(0) =1a(1) =4a(2) =14a(3) =2a(4) =15a(5) =19a(6) =26a(7) =118a(8) =128a(9) =1388a(10) =18588a(11) =111143a(12) =11721111115

External references