login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Smallest perfect power of n containing n in binary representation.
2

%I #3 Mar 30 2012 18:50:44

%S 0,1,4,27,16,125,216,343,64,729,1000,161051,1728,28561,2744,3375,256,

%T 4913,5832,47045881,8000,85766121,5153632,12167,13824,9765625,

%U 11881376,729,21952,24389,27000,29791,1024,35937,39304,1838265625

%N Smallest perfect power of n containing n in binary representation.

%C a(n) = n^A086063(n).

%e n=30='11110' is not contained in 30^2 = 900 = '1110000100' but in

%e a(3) = 30^3 = 27000 = '110100101111000'.

%Y Cf. A007088.

%K nonn

%O 0,3

%A _Reinhard Zumkeller_, May 08 2004