This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A073600 #14 Apr 21 2021 17:34:08
%S A073600 1,256,387420489,4096,59604644775390625,60466176,79792266297612001,
%T A073600 8589934592,984770902183611232881,100,121,144,169,196,11390625,
%U A073600 1048576,1419857,104976,130321,25600000000,278218429446951548637196401
%N A073600 Least n^k with same leading decimal digit as n, k>1.
%H A073600 Robert Israel, <a href="/A073600/b073600.txt">Table of n, a(n) for n = 1..5995</a>
%F A073600 a(n) = n^A073601(n);
%F A073600 A000030(a(n)) = A000030(n).
%e A073600 a(4)=4096, as 4096=4^6 is the least power of 4 with initial digit =4: 4^2=16, 4^3=64, 4^4=256 and 4^5=1024; A073601(4)=6.
%p A073600 f:= proc(n) local t,k,m;
%p A073600 t:= floor(n/10^ilog10(n));
%p A073600 for k from 2 do
%p A073600 m:= n^k;
%p A073600 if floor(m/10^ilog10(m)) = t then return m fi
%p A073600 od
%p A073600 end proc:
%p A073600 map(f, [$1..100]); # _Robert Israel_, Apr 21 2021
%t A073600 fi[n_] := First[IntegerDigits[n]]; Table[k = 2; While[fi[x = n^k] != fi[n], k++]; x, {n, 21}] (* _Jayanta Basu_, Jul 02 2013 *)
%K A073600 nonn,base,look
%O A073600 1,2
%A A073600 _Reinhard Zumkeller_, Aug 04 2002