|
|
A070406
|
|
a(n) = 7^n mod 15.
|
|
1
|
|
|
1, 7, 4, 13, 1, 7, 4, 13, 1, 7, 4, 13, 1, 7, 4, 13, 1, 7, 4, 13, 1, 7, 4, 13, 1, 7, 4, 13, 1, 7, 4, 13, 1, 7, 4, 13, 1, 7, 4, 13, 1, 7, 4, 13, 1, 7, 4, 13, 1, 7, 4, 13, 1, 7, 4, 13, 1, 7, 4, 13, 1, 7, 4, 13, 1, 7, 4, 13, 1, 7, 4, 13, 1, 7, 4, 13, 1, 7, 4, 13, 1, 7, 4, 13, 1, 7, 4, 13, 1, 7, 4, 13, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
FORMULA
|
a(n) = a(n-4).
G.f.: ( -1 - 7*x - 4*x^2 - 13*x^3 ) / ( (x-1)*(1+x)*(1+x^2) ). (End)
E.g.f.: (1/2)*(5*cosh(x) + 20*sinh(x) - 3*cos(x) - 6*sin(x)). - G. C. Greubel, Mar 20 2016
|
|
MATHEMATICA
|
LinearRecurrence[{0, 0, 0, 1}, {1, 7, 4, 13}, 100] (* or *) PadRight[{}, 100, {1, 7, 4, 13}] (* Harvey P. Dale, Oct 13 2018 *)
|
|
PROG
|
(Sage) [power_mod(7, n, 15) for n in range(0, 93)] # Zerinvary Lajos, Nov 27 2009
(PARI) a(n) = lift(Mod(7, 15)^n); \\ Altug Alkan, Mar 20 2016
(Magma) [Modexp(7, n, 15): n in [0..100]]; // Bruno Berselli, Mar 22 2016
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|