|
| |
|
|
A038194
|
|
Iterated sum-of-digits of n-th prime; or digital root of n-th prime; or n-th prime modulo 9.
|
|
34
| |
|
|
2, 3, 5, 7, 2, 4, 8, 1, 5, 2, 4, 1, 5, 7, 2, 8, 5, 7, 4, 8, 1, 7, 2, 8, 7, 2, 4, 8, 1, 5, 1, 5, 2, 4, 5, 7, 4, 1, 5, 2, 8, 1, 2, 4, 8, 1, 4, 7, 2, 4, 8, 5, 7, 8, 5, 2, 8, 1, 7, 2, 4, 5, 1, 5, 7, 2, 7, 4, 5, 7, 2, 8, 7, 4, 1, 5, 2, 1, 5, 4, 5, 7, 8, 1, 7, 2, 8
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Integers with iterated sum-of-digits 3, 6 or 9 are divisible by 3, so 3 is the only prime with iterated sum-of-digits 3 and there are no primes with iterated sum-of-digits 6 or 9.
|
|
|
LINKS
| Nathaniel Johnston, Table of n, a(n) for n = 1..10000
|
|
|
EXAMPLE
| Prime(5) = 11, 1 + 1 = 2 hence a(5) = 2.
a(297)=7 because the 297th prime is 1951 and 1+9+5+1 = 16 -> 1+6 = 7.
|
|
|
MAPLE
| A038194 := proc(n) return ithprime(n) mod 9: end: seq(A038194(n), n=1..100); # Nathaniel Johnston, May 04 2011
|
|
|
MATHEMATICA
| Table[Mod[Prime[n], 9], {n, 200}]
|
|
|
PROG
| (PARI) forprime(p=2, 600, print1(p%9, ", "))
|
|
|
CROSSREFS
| Cf. A007605, A010888, A061237 - A061242, A139413.
Cf. A153110. [From Odimar Fabeny (aifab(AT)yahoo.com.br), Sep 05 2010]
Sequence in context: A076779 A074464 A074463 * A111309 A007605 A077765
Adjacent sequences: A038191 A038192 A038193 * A038195 A038196 A038197
|
|
|
KEYWORD
| easy,nonn,base
|
|
|
AUTHOR
| Den Roussel (DenRoussel(AT)webtv.net) and Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
EXTENSIONS
| Edited by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Feb 16, 2002
Edited by N. J. A. Sloane (njas(AT)research.att.com), May 14 2008 at the suggestion of R. J. Mathar.
|
| |
|
|
