cp's OEIS Frontend

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.

A244060 Sum of digits of (2^n)!.

Original entry on oeis.org

1, 2, 6, 9, 63, 108, 324, 828, 1989, 4635, 10845, 24363, 54279, 118827, 258705, 565389, 1216134, 2611359, 5584518, 11875977, 25184205, 53209728, 112069377, 235502361, 493827687, 1033041267, 2156974227, 4495662081, 9355185828, 19437382512, 40329016200
Offset: 0

Views

Author

Robert G. Wilson v, Jun 18 2014

Keywords

Examples

			If n=4, 2^4! = 16! = 20922789888000, with digit sum 63. - _N. J. A. Sloane_, Jun 18 2014
		

Crossrefs

Programs

  • Mathematica
    f[n_] := Total[ IntegerDigits[ (2^n)!]]; Array[f, 20, 0]
  • PARI
    a(n) = sumdigits((2^n)!); \\ Michel Marcus, Oct 25 2021
    
  • Python
    from math import factorial
    def A244060(n): return sum(int(d) for d in str(factorial(2**n))) # Chai Wah Wu, Oct 26 2021

Formula

a(n) = A007953(A000722(n)). - Michel Marcus, Jun 19 2014

Extensions

a(26)-a(30) from Chai Wah Wu, Oct 25 2021