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

A073637
Digital root (cf. A010888) of prime(n)^3.
0
8, 9, 8, 1, 8, 1, 8, 1, 8, 8, 1, 1, 8, 1, 8, 8, 8, 1, 1, 8, 1, 1, 8, 8, 1, 8, 1, 8, 1, 8, 1, 8, 8, 1, 8, 1, 1, 1, 8, 8, 8, 1, 8, 1, 8, 1, 1, 1, 8, 1, 8, 8, 1, 8, 8, 8, 8, 1, 1, 8, 1, 8, 1, 8, 1, 8, 1, 1, 8, 1, 8, 8, 1, 1, 1, 8, 8, 1, 8, 1, 8, 1, 8, 1, 1, 8, 8, 1, 8, 1, 8, 8, 1, 8, 1, 8, 8, 8, 1, 1
OFFSET
1,1
COMMENTS
Apart from a(2)=9 all other terms are either 1 or 8.
EXAMPLE
a(3)=8 because p(3)=5 and 5^3=125 -> sum-of-digits = 8. a(4)=1 because p(3)=7 and 7^3=343 -> sum-of-digits = 10 -> sum-of-digits = 1.
MATHEMATICA
n=3; su[x_] := Sum[IntegerDigits[x][[i]], {i, Length[IntegerDigits[x]]}]; Table[su[su[su[su[Prime[x]^n]]]], {x, 100}]
Table[If[(m9=Mod[Prime[n]^3, 9])==0, 9, m9], {n, 200}]
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Zak Seidov, Sep 01 2002, Oct 23 2009
EXTENSIONS
Edited by N. J. A. Sloane, Oct 29 2009
STATUS
approved