|
| |
|
|
A100401
|
|
Digital root of 3^n.
|
|
0
| |
|
|
1, 3, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| 3^n mod 18. [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 25 2009]
|
|
|
PROG
| (PARI) f(n, m) = for(x=0, n, print1(droot(m^x)", ")) droot(n) = \ the digital root of a number. { local(x); x= n%9; if(x>0, return(x), return(9)) }
(Other) sage: [power_mod(3, n, 18)for n in xrange(0, 105)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 25 2009]
|
|
|
CROSSREFS
| Sequence in context: A188444 A201409 A111120 * A004166 A110759 A063750
Adjacent sequences: A100398 A100399 A100400 * A100402 A100403 A100404
|
|
|
KEYWORD
| easy,nonn,base
|
|
|
AUTHOR
| Cino Hilliard (hillcino368(AT)gmail.com), Dec 30 2004
|
| |
|
|
