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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #30 Dec 04 2024 17:51:10
%S 1,1,4,9,13,11,27,25,37,45,1,41,54,58,52,99,88,98,108,127,31,117,148,
%T 146,153,151,154,189,163,167,63,184,205,207,214,260,270,271,265,306,
%U 112,308,315,313,325,306,352,374,333,355,151,414,412,350,378,442,391,450
%N a(n) = sum of the digits of n^n.
%H Harry J. Smith, <a href="/A066588/b066588.txt">Table of n, a(n) for n = 0..1000</a>
%e a(7) = 25 because 7^7 = 823543 and 8 + 2 + 3 + 5 + 4 + 3 = 25.
%p a:= n-> add(i, i=convert(n^n, base, 10)):
%p seq(a(n), n=0..60); # _Alois P. Heinz_, Oct 06 2023
%t Table[Plus@@IntegerDigits@(n^n), {n, 80}] (* _Vincenzo Librandi_, Jun 18 2015 *)
%o (PARI) a(n) = sumdigits(n^n) \\ _Michel Marcus_, Jun 18 2015
%o (Magma) [&+Intseq((n^n)): n in [0..80] ]; // _Vincenzo Librandi_, Jun 18 2015
%Y Cf. A000312, A007953, A004152.
%K base,nonn
%O 0,3
%A Robert A. Stump (bee_ess107(AT)yahoo.com), Jan 07 2002
%E More terms from _Paolo P. Lava_, May 15 2007
%E a(0)=1 inserted by _Sean A. Irvine_, Oct 06 2023