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 A062331 #25 Nov 23 2024 18:40:58
%S A062331 1,4,9,16,25,36,49,64,81,1,2,6,12,20,30,42,56,72,90,4,6,16,30,48,70,
%T A062331 96,126,160,198,9,12,30,54,84,120,162,210,264,324,16,20,48,84,128,180,
%U A062331 240,308,384,468,25,30,70,120,180,250,330,420,520,630,36,42,96,162,240,330
%N A062331 a(n) is the product of the sum and the product of the digits of n (0 is not to be considered a factor in the product).
%H A062331 Alois P. Heinz, <a href="/A062331/b062331.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Harry J. Smith)
%e A062331 a(49) = (4+9)*(4*9) = 13*36 = 458.
%p A062331 a:= n-> (l-> add(i, i=l)*mul(`if`(i=0, 1, i), i=l))(convert(n, base, 10)):
%p A062331 seq(a(n), n=1..100); # _Alois P. Heinz_, Jun 29 2018
%t A062331 psd[n_]:=Module[{idnx0=Select[IntegerDigits[n],#>0&]},Times@@idnx0 Total[idnx0]]
%t A062331 psd/@Range[90] (* _Harvey P. Dale_, Feb 24 2011 *)
%t A062331 Array[Times @@ DeleteCases[#, 0]*Total@ # &@ IntegerDigits[#] &, 65] (* _Michael De Vlieger_, Jun 29 2018 *)
%o A062331 (PARI) a(n) = sumdigits(n) * vecprod(select(t->t, digits(n))) \\ _Harry J. Smith_, Aug 05 2009
%Y A062331 Cf. A007953, A051801.
%K A062331 nonn,easy,base
%O A062331 1,2
%A A062331 _Amarnath Murthy_, Jun 21 2001
%E A062331 More terms from Larry Reeves (larryr(AT)acm.org), Jun 22 2001