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 A256556 #21 May 02 2015 20:10:13 %S A256556 0,0,0,0,0,0,0,0,0,10,11,12,13,14,15,16,17,18,19,20,42,88,184,384,800, %T A256556 1664,3456,7168,14848,30,93,288,891,2754,8505,26244,80919,249318, %U A256556 767637,40,164,672,2752,11264,46080,188416,770048,3145728,12845056,50,255,1300,6625 %N A256556 If n = 10k+m (0 <= m <= 9) then a(n) = n*k^m. %H A256556 Reinhard Zumkeller, <a href="/A256556/b256556.txt">Table of n, a(n) for n = 1..10000</a> %e A256556 10 yields 10*(1^0) = 10; %e A256556 43 yields 43*(4^3)= 43*64=2754; %e A256556 68 yields 68*(6^8)= 68*1679616 = 114213888. %p A256556 f:=proc(n) local k,m; m := (n mod 10); k := (n-m)/10; n*k^m; end; %p A256556 [seq(f(n),n=1..40)]; %o A256556 (Haskell) %o A256556 a256556 n = n * uncurry (^) (divMod n 10) %o A256556 -- _Reinhard Zumkeller_, May 02 2015 %K A256556 nonn,look %O A256556 1,10 %A A256556 _Andy Edwards_, Apr 01 2015 %E A256556 Entry revised by _N. J. A. Sloane_, May 02 2015