login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071421 a(n) = a(n-1) + sum of decimal digits of n^n. 1

%I #9 Dec 11 2016 11:24:32

%S 1,5,14,27,38,65,90,127,172,173,214,268,326,378,477,565,663,771,898,

%T 929,1046,1194,1340,1493,1644,1798,1987,2150,2317,2380,2564,2769,2976,

%U 3190,3450,3720,3991,4256,4562,4674,4982,5297,5610,5935,6241,6593,6967

%N a(n) = a(n-1) + sum of decimal digits of n^n.

%H Harvey P. Dale, <a href="/A071421/b071421.txt">Table of n, a(n) for n = 1..1000</a>

%t s=0; Do[s=s+Apply[Plus, IntegerDigits[n^n]]; Print[s], {n, 1, 128}]

%t nxt[{n_,a_}]:={n+1,a+Total[IntegerDigits[(n+1)^(n+1)]]}; NestList[nxt,{1,1},50][[All,2]] (* _Harvey P. Dale_, Dec 11 2016 *)

%Y Cf. A037123, A000788, A051351.

%K base,easy,nonn

%O 1,2

%A _Labos Elemer_, May 27 2002

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 15:20 EDT 2024. Contains 371916 sequences. (Running on oeis4.)