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 A113010 #8 Feb 28 2019 22:16:41
%S A113010 1,1,1,1,1,1,1,1,1,1,2,4,8,16,32,64,128,256,512,1024,4,8,16,32,64,128,
%T A113010 256,512,1024,2048,8,16,32,64,128,256,512,1024,2048,4096,16,32,64,128,
%U A113010 256,512,1024,2048,4096,8192,32,64,128,256,512,1024,2048,4096,8192
%N A113010 {Number of digits of n} raised to the power of {the sum of the digits of n}.
%C A113010 n=1 and 32 are two fixed points. Are there any others?
%C A113010 There are no other fixed points less than 10^1000. - _Chai Wah Wu_, Feb 28 2019
%F A113010 a(ijk...) [m digits ijk...] = m^(i+j+k+...)
%o A113010 (Python)
%o A113010 def A113010(n):
%o A113010 return len(str(n))**sum(int(d) for d in str(n)) # _Chai Wah Wu_, Feb 28 2019
%Y A113010 Cf. A101337.
%K A113010 base,easy,nonn
%O A113010 0,11
%A A113010 _Alexandre Wajnberg_, Jan 03 2006