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 A195191 #17 Apr 13 2019 10:41:49 %S A195191 32,402,2401,2030,10112,10,200,10200,10010,100200,1000110,1000200,100, %T A195191 20000,10200000,1001000,100200000,1000110000,1000200000,1000,2000000, %U A195191 10200000000,100100000,100200000000,1000110000000,1000000000100,10000,200000000 %N A195191 Smallest n-Smith number. %C A195191 The smallest number for which the sum of the digits of its prime factors equals n multiplied by the sum of its digits. %H A195191 Shyam Sunder Gupta, <a href="http://www.shyamsundergupta.com/smith.htm">Smith numbers</a> %e A195191 The first term of A104390, the first term of A104391, the first term of A103125 etc. %p A195191 A007953 := proc(n) add(d,d=convert(n,base,10)) ; end proc: %p A195191 A118503 := proc(n) a := 0 ; for p in ifactors(n)[2] do a := a+ op(2,p)*A007953(op(1,p)) ; end do: a ; end proc: %p A195191 A195191 := proc(n) for k from 1 do if A118503(k) = n*A007953(k) then return k; end if; end do: end proc: # _R. J. Mathar_, Sep 14 2011 %K A195191 nonn,base %O A195191 2,1 %A A195191 _Kausthub Gudipati_, Sep 11 2011 %E A195191 a(12)-a(29) from _Donovan Johnson_, Sep 15 2011