|
|
A070403
|
|
a(n) = 7^n mod 9.
|
|
8
|
|
|
1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Also the digital root of 7^n. If we convert this to a repeating decimal 0.174174..., we get the rational number 58/333. - Cino Hilliard, Dec 31 2004
Digital root of the powers of any number congruent to 7 mod 9. - Alonso del Arte, Jan 26 2014
|
|
REFERENCES
|
Cecil Balmond, Number 9: The Search for the Sigma Code. Munich, New York: Prestel (1998): 203.
|
|
LINKS
|
|
|
FORMULA
|
G.f.: (1+7*x+4*x^2)/((1-x)*(1+x+x^2)).
|
|
MAPLE
|
|
|
MATHEMATICA
|
|
|
PROG
|
(Sage) [power_mod(7, n, 9)for n in range(0, 105)] # Zerinvary Lajos, Nov 03 2009
(Magma) [Modexp(7, n, 9): n in [0..110]]; // Bruno Berselli, Mar 22 2016
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|