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 n-th power starting with n.
2

%I #6 Sep 04 2021 15:32:30

%S 1,25,343,4096,59049,64,78125,815730721,922190162669056,1024,

%T 116490258898219,129746337890625,13060694016,

%U 147653612273582215982104576,15407021574586368,16400152899115243850138976256,17179869184

%N Smallest n-th power starting with n.

%H Jon E. Schoenfield, <a href="/A067457/b067457.txt">Table of n, a(n) for n = 1..302</a>

%t Do[k = Floor[ Log[ 10, n] + 1]; While[ FromDigits[ Take[ IntegerDigits [k^n], Floor[ Log[ 10, n] + 1]]] != n, k++ ]; Print[k^n], {n, 1, 20} ]

%Y Cf. A067442, A067443, A067444, A067445, A067446, A067447, A067448, A067449, A067450, A068001.

%K base,easy,nonn

%O 1,2

%A _Amarnath Murthy_, Feb 07 2002

%E Edited and extended by _Robert G. Wilson v_, Feb 08 2002