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 A113009 #11 Feb 28 2019 18:52:26
%S A113009 0,1,2,3,4,5,6,7,8,9,1,4,9,16,25,36,49,64,81,100,4,9,16,25,36,49,64,
%T A113009 81,100,121,9,16,25,36,49,64,81,100,121,144,16,25,36,49,64,81,100,121,
%U A113009 144,169,25,36,49,64,81,100,121,144,169,196,36,49,64,81,100,121,144,169,196
%N A113009 {Sum of the digits of n} raised to the power {number of digits of n}.
%C A113009 Fixed points are: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 81, 5832. Are there any others?
%C A113009 Fixed points include: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 81, 512, 2401. There are no other fixed points less than 10^1000. - _Chai Wah Wu_, Feb 28 2019
%F A113009 a(ijk...)[m digits ijk...]=(i+j+k)^m
%e A113009 a(9)=9^1=9
%e A113009 a(19)=(1+9)^2=100
%e A113009 a(101)=(1+0+1)^3=8
%t A113009 Join[{0},Table[Total[IntegerDigits[n]]^IntegerLength[n],{n,100}]] (* _Harvey P. Dale_, Nov 09 2014 *)
%o A113009 (Python)
%o A113009 def A113009(n):
%o A113009 return sum(int(d) for d in str(n))**len(str(n)) # _Chai Wah Wu_, Feb 28 2019
%Y A113009 Cf. A101337.
%K A113009 base,easy,nonn
%O A113009 0,3
%A A113009 _Alexandre Wajnberg_, Jan 03 2006