%I
%S 1,2,3,2,13,11,13,2,3,25,5,7,15,35,35,2,57,31,13,77,37,23,7,29,15,25,
%T 3,51,27,61,5,2,43,37,57,25,17,31,13,69,75,13,49,9,13,75,99,45,103,57,
%U 37,35,23,25,23,75,23,295,23,163,21,5,23,2,3,79,23,123,23,345,33,5,15
%N Least k such that k^n starts with n in base 2.
%H Seiichi Manyama, <a href="/A177048/b177048.txt">Table of n, a(n) for n = 1..5000</a>
%o (Haskell)
%o toBinary 0 = []
%o toBinary n = toBinary (n `div` 2) ++ [odd n]
%o a = [1 + fromJust (findIndex (isPrefixOf (toBinary n)) [toBinary (k ^ n)  k < [1..]])  n < [1..]]
%Y Cf. A177047.
%K nonn,base,easy
%O 1,2
%A _Vladimir Reshetnikov_, May 01 2010
%E More terms from _Seiichi Manyama_, Dec 22 2019
