|
|
A065999
|
|
Sum of digits of 9^n.
|
|
15
|
|
|
1, 9, 9, 18, 18, 27, 18, 45, 27, 45, 45, 45, 54, 63, 72, 63, 63, 99, 81, 90, 90, 90, 90, 108, 117, 144, 117, 108, 90, 126, 99, 153, 144, 117, 153, 144, 162, 171, 153, 153, 153, 198, 162, 171, 198, 216, 171, 198, 198, 225, 153, 252, 216, 234, 207
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI) SumD(x)= { local(s=0); while (x>9, s+=x%10; x\=10); return(s + x) } { for (n=0, 1000, a=SumD(9^n); write("b065999.txt", n, " ", a) ) } \\ Harry J. Smith, Nov 06 2009
|
|
CROSSREFS
|
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), this sequence (k=9), A066005 (k=11), A066006 (k=12), A175527 (k=13).
|
|
KEYWORD
|
nonn,easy,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|