The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A202358 Sum of digits of n^(n!). 1
 0, 1, 4, 18, 73, 334, 2592, 18919, 164476, 1558521, 1, 187044031, 2326111614, 31214008090 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS a(10^k) = 1. - Chai Wah Wu, Dec 18 2019 LINKS FORMULA a(n) = A007953(A053986(n)). - Michel Marcus, Aug 22 2013 EXAMPLE a(3) = 18 because 3^3! = 729 with digit sum 7+2+9 = 18. MAPLE ds:= proc(n) local r;        `if`(n<10, n, ds(iquo(n, 10^iquo(length(n), 2), 'r'))+ds(r))      end: a:= n-> ds(n^n!): seq(a(n), n=0..10);  # Alois P. Heinz, Dec 17 2011 PROG (Python) from math import factorial def a(n): return sum(map(int, str(n**(factorial(n))))) print([a(n) for n in range(10)]) # Michael S. Branicky, Jan 28 2021 CROSSREFS Cf. A053986, A007953, A202336. Sequence in context: A343580 A027905 A037497 * A075675 A047034 A266753 Adjacent sequences:  A202355 A202356 A202357 * A202359 A202360 A202361 KEYWORD nonn,base,more AUTHOR Jacques ALARDET, Dec 17 2011 EXTENSIONS a(11)-a(12) from Lars Blomberg, Jan 18 2013 a(13) from Chai Wah Wu, Oct 25 2021 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 3 00:59 EST 2021. Contains 349445 sequences. (Running on oeis4.)