|
|
A070392
|
|
a(n) = 6^n mod 11.
|
|
4
|
|
|
1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Period 10 (Repeat): [1, 6, 3, 7, 9, 10, 5, 8, 4, 2, ...]. The sequence contains every number from 1 to 10 and only those numbers. - Wesley Ivan Hurt, May 19 2014
|
|
LINKS
|
|
|
FORMULA
|
a(n) = a(n-1) - a(n-5) + a(n-6).
G.f.: ( -1-5*x+3*x^2-4*x^3-2*x^4-2*x^5 )/((x-1)*(1+x)(x^4-x^3+x^2-x+1) ). (End)
|
|
MAPLE
|
|
|
MATHEMATICA
|
|
|
PROG
|
(Sage) [power_mod(6, n, 11)for n in range(0, 99)] # Zerinvary Lajos, Nov 26 2009
(PARI) a(n) = lift(Mod(6, 11)^n); \\ Altug Alkan, Mar 18 2016
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|