login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A135449
Period 5: repeat [1, 9, -7, 3, 5].
2
1, 9, -7, 3, 5, 1, 9, -7, 3, 5, 1, 9, -7, 3, 5, 1, 9, -7, 3, 5, 1, 9, -7, 3, 5, 1, 9, -7, 3, 5, 1, 9, -7, 3, 5, 1, 9, -7, 3, 5, 1, 9, -7, 3, 5, 1, 9, -7, 3, 5, 1, 9, -7, 3, 5, 1, 9, -7, 3, 5, 1, 9, -7, 3, 5, 1, 9, -7, 3, 5, 1, 9, -7, 3, 5, 1, 9, -7, 3, 5, 1, 9, -7, 3, 5, 1, 9, -7, 3, 5, 1, 9, -7, 3, 5, 1
OFFSET
0,2
FORMULA
a(n) == 9a(n-1) mod 11.
O.g.f.: -(1+9*x-7*x^2+3*x^3+5*x^4)/((x-1)*(1+x+x^2+x^3+x^4)). - R. J. Mathar, Jan 07 2008
MAPLE
A135449 := proc(n) op((n mod 5)+1, [1, 9, -7, 3, 5]) ; end: seq(A135449(n), n=0..150) ; # R. J. Mathar, Feb 07 2009
PROG
(PARI) a(n)=[1, 9, -7, 3, 5][n%5+1] \\ Charles R Greathouse IV, Jun 02 2011
CROSSREFS
Sequence in context: A251734 A033873 A260880 * A060388 A081821 A164102
KEYWORD
sign,easy,less
AUTHOR
Paul Curtz, Dec 14 2007
EXTENSIONS
More periods from R. J. Mathar, Feb 07 2009
STATUS
approved