|
|
A070399
|
|
a(n) = 6^n mod 31.
|
|
1
|
|
|
1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
FORMULA
|
a(n) = a(n-1) - a(n-3) + a(n-4).
G.f.: ( -1-5*x+x^2-26*x^3 ) / ( (x-1)*(1+x)*(x^2-x+1) ). (End)
|
|
MATHEMATICA
|
|
|
PROG
|
(Sage) [power_mod(6, n, 31)for n in range(0, 83)] # Zerinvary Lajos, Nov 27 2009
(PARI) a(n) = lift(Mod(6, 31)^n); \\ Altug Alkan, Mar 18 2016
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|