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 A277216 #15 May 19 2025 23:45:10
%S A277216 1,3,4,7,6,2,8,5,3,8,2,16,4,8,8,3,8,27,0,8,6,18,8,0,3,8,0,30,0,14,6,
%T A277216 18,32,20,32,9,24,0,30,0,8,54,16,32,56,14,32,8,35,27,14,72,20,0,14,0,
%U A277216 0,0,0,48,12,54,0,14,32,16,48,12,54,16,14,45,28,4,8
%N A277216 Product of decimal digits of sum of divisors of n.
%C A277216 Conjecture: a(n) = n only for numbers 1 and 210; sigma(210) = 576; a(210) = 5*7*6 = 210.
%H A277216 Jaroslav Krizek, <a href="/A277216/b277216.txt">Table of n, a(n) for n = 1..1000</a>
%F A277216 a(n) = A007954(A000203(n)).
%e A277216 a(12) = 16 because sigma(12) = 28; 2*8 = 16.
%p A277216 seq( convert(convert(numtheory:-sigma(n),base,10),`*`), n=1..100); # _Robert Israel_, Oct 06 2016
%t A277216 Table[Times @@ IntegerDigits@ DivisorSigma[1, n], {n, 75}] (* _Michael De Vlieger_, Oct 06 2016 *)
%o A277216 (Magma) [&*Intseq(SumOfDivisors(n)): n in [1..100000]];
%o A277216 (PARI) a(n) = d = digits(sigma(n)); prod(k=1, #d, d[k]); \\ _Michel Marcus_, Oct 05 2016
%Y A277216 Cf. A067342 (sum of decimal digits of sigma(n)).
%Y A277216 Cf. A000203, A007954, A277217.
%K A277216 nonn,base
%O A277216 1,2
%A A277216 _Jaroslav Krizek_, Oct 05 2016