|
|
A070396
|
|
a(n) = 6^n mod 23.
|
|
1
|
|
|
1, 6, 13, 9, 8, 2, 12, 3, 18, 16, 4, 1, 6, 13, 9, 8, 2, 12, 3, 18, 16, 4, 1, 6, 13, 9, 8, 2, 12, 3, 18, 16, 4, 1, 6, 13, 9, 8, 2, 12, 3, 18, 16, 4, 1, 6, 13, 9, 8, 2, 12, 3, 18, 16, 4, 1, 6, 13, 9, 8, 2, 12, 3, 18, 16, 4, 1, 6, 13, 9, 8, 2, 12, 3, 18, 16, 4, 1, 6, 13, 9, 8, 2, 12, 3, 18, 16, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
|
|
FORMULA
|
a(n) = a(n-11).
G..f: ( -1-6*x-13*x^2-9*x^3-8*x^4-2*x^5-12*x^6-3*x^7-18*x^8-16*x^9-4*x^10 ) / ( (x-1)*(1+x+x^2+x^3+x^4+x^5+x^6+x^7+x^8+x^9+x^10) ). (End)
|
|
MATHEMATICA
|
|
|
PROG
|
(Sage) [power_mod(6, n, 23)for n in range(0, 88)] # Zerinvary Lajos, Nov 27 2009
(PARI) a(n) = lift(Mod(6, 23)^n); \\ Altug Alkan, Mar 18 2016
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|