OFFSET
0,2
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,0,-1,1).
FORMULA
From R. J. Mathar, Apr 20 2010: (Start)
a(n) = a(n-1) - a(n-9) + a(n-10).
G.f.: ( -1-4*x-20*x^2+8*x^3+13*x^4-16*x^5+x^6+5*x^7-2*x^8-11*x^9 ) / ( (x-1)*(1+x)*(x^2-x+1)*(x^6-x^3+1) ). (End)
a(n) = a(n-18). - G. C. Greubel, Mar 13 2016
MAPLE
MATHEMATICA
PowerMod[5, Range[0, 80], 27] (* or *) LinearRecurrence[ {1, 0, 0, 0, 0, 0, 0, 0, -1, 1}, {1, 5, 25, 17, 4, 20, 19, 14, 16, 26}, 80] (* Harvey P. Dale, Aug 12 2012 *)
PROG
(Sage) [power_mod(5, n, 27) for n in range(0, 78)] # Zerinvary Lajos, Nov 26 2009
(PARI) a(n)=lift(Mod(5, 27)^n) \\ Charles R Greathouse IV, Mar 22 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 12 2002
STATUS
approved