login
This site is supported by donations to The OEIS Foundation.

 

Logo

The submissions stack has been unacceptably high for several months now. Please voluntarily restrict your submissions and please help with the editing. (We don't want to have to impose further limits.)

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066588 The sum of the digits of n^n. 5
1, 4, 9, 13, 11, 27, 25, 37, 45, 1, 41, 54, 58, 52, 99, 88, 98, 108, 127, 31, 117, 148, 146, 153, 151, 154, 189, 163, 167, 63, 184, 205, 207, 214, 260, 270, 271, 265, 306, 112, 308, 315, 313, 325, 306, 352, 374, 333, 355, 151, 414, 412, 350, 378, 442, 391, 450 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Harry J. Smith, Table of n, a(n) for n=1..1000

EXAMPLE

a(7) = 25 because 7^7 = 823543 and 8 + 2 + 3 + 5 + 4 + 3 = 25.

MAPLE

P:=proc(n) local i, k, w; for i from 1 by 1 to n do w:=0; k:=i^i; while k>0 do w:=w+k-(trunc(k/10)*10); k:=trunc(k/10); od; print(w); od; end: P(100); # Paolo P. Lava, May 15 2007

MATHEMATICA

Table[Plus@@IntegerDigits@(n^n), {n, 80}] (* Vincenzo Librandi, Jun 18 2015 *)

PROG

(PARI) SumD(x)= { local(s=0); while (x>9, s+=x%10; x\=10); return(s + x) } { for (n=1, 1000, write("b066588.txt", n, " ", SumD(n^n)) ) } \\ Harry J. Smith, Mar 08 2010

(PARI) vector(100, n, sumdigits(n^n)) \\ Michel Marcus, Jun 18 2015

(MAGMA) [&+Intseq((n^n)): n in [1..80] ]; // Vincenzo Librandi, Jun 18 2015

CROSSREFS

Cf. A000312, A004152.

Sequence in context: A197615 A125848 A225752 * A135740 A247881 A010412

Adjacent sequences:  A066585 A066586 A066587 * A066589 A066590 A066591

KEYWORD

base,nonn

AUTHOR

Robert A. Stump (bee_ess107(AT)yahoo.com), Jan 07 2002

EXTENSIONS

More terms from Paolo P. Lava, May 15 2007

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified August 28 00:41 EDT 2015. Contains 261101 sequences.