Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073637
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073637 Digital root (cf. A010888) of prime(n)^3. +0
1
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 (list; graph; listen)
OFFSET

1,1

COMMENT

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

Cf. A010888, A021596, A056992, A010888, A038194, A166923.

Sequence in context: A154582 A020507 A011463 this_sequence A153202 A019738 A135466

Adjacent sequences: A073634 A073635 A073636 this_sequence A073638 A073639 A073640

KEYWORD

nonn,base

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Sep 01 2002, Oct 23 2009

EXTENSIONS

Edited by njas, Oct 29 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research