|
|
A070357
|
|
a(n) = 3^n mod 28.
|
|
1
|
|
|
1, 3, 9, 27, 25, 19, 1, 3, 9, 27, 25, 19, 1, 3, 9, 27, 25, 19, 1, 3, 9, 27, 25, 19, 1, 3, 9, 27, 25, 19, 1, 3, 9, 27, 25, 19, 1, 3, 9, 27, 25, 19, 1, 3, 9, 27, 25, 19, 1, 3, 9, 27, 25, 19, 1, 3, 9, 27, 25, 19, 1, 3, 9, 27, 25, 19, 1, 3, 9, 27, 25, 19, 1, 3, 9, 27, 25, 19, 1, 3, 9, 27, 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-2*x-6*x^2-19*x^3 ) / ( (x-1)*(1+x)*(x^2-x+1) ). (End)
a(n) = a(n-6).
E.g.f.: (1/3)*( 35*cosh(x) + 49*sinh(x) - 32*exp(x/2)*cos(sqrt(3)*x/2) - 16*sqrt(3)*exp(x/2)*sin(sqrt(3)*x/2) ). (End)
|
|
MATHEMATICA
|
|
|
PROG
|
(Sage) [power_mod(3, n, 28)for n in range(0, 83)] # Zerinvary Lajos, Nov 25 2009
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|