[go: up one dir, main page]

login

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”).

Sum of digits of 8^n.
14

%I #16 Nov 01 2013 17:08:33

%S 1,8,10,8,19,26,19,26,37,35,37,62,64,71,46,62,73,80,82,80,82,89,109,

%T 89,109,125,100,107,118,107,118,125,127,107,118,125,145,143,145,152,

%U 172,170,172,188,181,170,190,215,172,215,235,233,217,215

%N Sum of digits of 8^n.

%H Harry J. Smith, <a href="/A066004/b066004.txt">Table of n, a(n) for n = 0..1000</a>

%F a(n) = A007953(A001018(n)). - _Michel Marcus_, Nov 01 2013

%t Table[Total[IntegerDigits[8^n]], {n, 0, 60}] (* _Vincenzo Librandi_, Oct 08 2013 *)

%o (PARI) SumD(x)= { local(s=0); while (x>9, s+=x%10; x\=10); return(s + x) } { for (n=0, 1000, a=SumD(8^n); write("b066004.txt", n, " ", a) ) } \\ _Harry J. Smith_, Nov 06 2009

%o (PARI) a(n) = sumdigits(8^n); \\ _Michel Marcus_, Nov 01 2013

%Y Cf. sum of digits of k^n: A001370 (k=2), A004166 (k=3), A065713 (k=4), A066001 (k=5), A066002 (k=6), A066003(k=7), this sequence (k=8), A065999 (k=9), A066005 (k=11), A066006 (k=12), A175527 (k=13).

%K nonn,base

%O 0,2

%A _N. J. A. Sloane_, Dec 11 2001