|
| |
| |
|
|
|
1, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| For n>2, equal to 2^(n-2) mod 9 [From Michael B. Porter (michael_b_porter(AT)yahoo.com), Feb 02 2010]
Apart from leading terms the same as A146501, A153130 and A029898. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 13 2010]
|
|
|
LINKS
| Index to sequences with linear recurrences with constant coefficients, signature (1,0,-1,1,0).
|
|
|
FORMULA
| a(n)=(1/30)*{14*(n mod 6)-11*[(n+1) mod 6]-[(n+2) mod 6]+4*[(n+3) mod 6]+29*[(n+4) mod 6]+19*[(n+5) mod 6]}-6*[C(2*n,n) mod 2)], with n>=0 [From Paolo P. Lava (paoloplava(AT)gmail.com), Jan 13 2009]
a(n)=a(n-1)-a(n-3)+a(n-4), n>4. G.f.: (6*x^4+2*x^3+4*x+1-4*x^2)/((1-x)*(1+x)*(x^2-x+1)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 25 2009]
|
|
|
CROSSREFS
| Sequence in context: A120579 A093316 A085758 * A157823 A159703 A059521
Adjacent sequences: A154526 A154527 A154528 * A154530 A154531 A154532
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Paul Curtz (bpcrtz(AT)free.fr), Jan 11 2009
|
|
|
EXTENSIONS
| Edited by N. J. A. Sloane (njas(AT)research.att.com), Jan 12 2009
|
| |
|
|
