|
%I #21 Dec 28 2020 17:50:22
%S 1,6,9,9,18,27,27,36,36,36,36,45,45,36,54,63,54,72,72,63,72,81,63,72,
%T 90,90,99,99,90,135,117,99,126,126,135,135,126,135,135,162,171,126,
%U 153,153,153,162,180,162,153,162,171,216,171,216,171,162
%N Sum of digits of 6^n.
%H Harry J. Smith, <a href="/A066002/b066002.txt">Table of n, a(n) for n = 0..1000</a>
%F a(n) = A007953(A000400(n)). - _Michel Marcus_, Nov 01 2013 [corrected by _Georg Fischer_, Dec 28 2020]
%t Table[Total[IntegerDigits[6^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(6^n); write("b066002.txt", n, " ", a) ) } \\ _Harry J. Smith_, Nov 06 2009
%o (PARI) a(n) = sumdigits(6^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), this sequence (k=6), A066003(k=7), A066004 (k=8), A065999 (k=9), A066005 (k=11), A066006 (k=12), A175527 (k=13).
%Y Cf. A007953.
%K nonn,base
%O 0,2
%A _N. J. A. Sloane_, Dec 11 2001
|
