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 A244060 #25 Oct 26 2021 14:26:18 %S A244060 1,2,6,9,63,108,324,828,1989,4635,10845,24363,54279,118827,258705, %T A244060 565389,1216134,2611359,5584518,11875977,25184205,53209728,112069377, %U A244060 235502361,493827687,1033041267,2156974227,4495662081,9355185828,19437382512,40329016200 %N A244060 Sum of digits of (2^n)!. %F A244060 a(n) = A007953(A000722(n)). - _Michel Marcus_, Jun 19 2014 %e A244060 If n=4, 2^4! = 16! = 20922789888000, with digit sum 63. - _N. J. A. Sloane_, Jun 18 2014 %t A244060 f[n_] := Total[ IntegerDigits[ (2^n)!]]; Array[f, 20, 0] %o A244060 (PARI) a(n) = sumdigits((2^n)!); \\ _Michel Marcus_, Oct 25 2021 %o A244060 (Python) %o A244060 from math import factorial %o A244060 def A244060(n): return sum(int(d) for d in str(factorial(2**n))) # _Chai Wah Wu_, Oct 26 2021 %Y A244060 Cf. A000722, A007953. %Y A244060 Cf. A116988, A244061. %K A244060 nonn,base %O A244060 0,2 %A A244060 _Robert G. Wilson v_, Jun 18 2014 %E A244060 a(26)-a(30) from _Chai Wah Wu_, Oct 25 2021