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 #21 Dec 04 2024 15:39:48
%S 1,3,9,18,18,27,45,36,54,45,45,54,54,63,81,72,90,72,81,117,108,90,99,
%T 99,117,117,135,153,135,135,153,180,153,117,117,180,171,171,189,198,
%U 216,198,225,225,216,198,225,234,252,234,216,234,279,243
%N Sum of digits of 12^n.
%H Harry J. Smith, <a href="/A066006/b066006.txt">Table of n, a(n) for n = 0..1000</a>
%F a(n) = A007953(A001021(n)). - _Michel Marcus_, Nov 01 2013
%t Table[Total[IntegerDigits[12^n]], {n, 0, 60}] (* _Vincenzo Librandi_, Oct 08 2013 *)
%o (PARI) a(n) = sumdigits(12^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), A066004 (k=8), A065999 (k=9), A066005 (k=11), this sequence (k=12), A175527 (k=13).
%K nonn,base
%O 0,2
%A _N. J. A. Sloane_, Dec 11 2001