|
| |
|
|
A131290
|
|
1 followed by period 6 sequence formed by repeating 3, 2, 0, -1, 0, 2.
|
|
12
| |
|
|
1, 3, 2, 0, -1, 0, 2, 3, 2, 0, -1, 0, 2, 3, 2, 0, -1, 0, 2, 3, 2, 0, -1, 0, 2, 3, 2, 0, -1, 0, 2, 3, 2, 0, -1, 0, 2, 3, 2, 0, -1, 0, 2, 3, 2, 0, -1, 0, 2, 3, 2, 0, -1, 0, 2, 3, 2, 0, -1, 0, 2, 3, 2, 0, -1, 0, 2, 3, 2, 0, -1, 0, 2, 3, 2, 0, -1, 0, 2, 3, 2, 0, -1, 0, 2, 3, 2, 0, -1, 0, 2, 3, 2, 0, -1, 0, 2, 3, 2, 0, -1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
LINKS
| Index to sequences with linear recurrences with constant coefficients, signature (2,-2,1).
|
|
|
FORMULA
| a(n)=(1/30)*{-8*(n mod 6)-3*[(n+1) mod 6]+7*[(n+2) mod 6]+12*[(n+3) mod 6]+7*[(n+4) mod 6]-3*[(n+5) mod 6]}+[(n+2) mod (n+1)]-1, with n>=0 - Paolo P. Lava (paoloplava(AT)gmail.com), Oct 24 2007
O.g.f.: -1+(x+1)/(x^2-x+1)-1/(x-1). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 27 2008
If n mod 6 = 4 then a(n)=(Fibonacci(n-3)*Fibonacci(n+1))mod 4 -2, else a(n)=(Fibonacci(n-3)*Fibonacci(n+1))mod 4, n>0 [From Gary Detlefs (gdetlefs(AT)aol.com) Dec 12 2010]
|
|
|
MAPLE
| A131290 := proc(n) if n = 0 then 1; else op(((n-1)mod 6)+1, [3, 2, 0, -1, 0, 2]) ; fi ; end: seq(A131290(n), n=0..100) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 27 2008
|
|
|
CROSSREFS
| Cf. A130869, A079757, A100219.
Sequence in context: A144553 A187130 A187145 * A116604 A138741 A079618
Adjacent sequences: A131287 A131288 A131289 * A131291 A131292 A131293
|
|
|
KEYWORD
| sign,easy
|
|
|
AUTHOR
| Paul Curtz (bpcrtz(AT)free.fr), Sep 29 2007
|
|
|
EXTENSIONS
| More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 27 2008
|
| |
|
|
