|
| |
|
|
A131555
|
|
Period 6: repeat 0,0,1,1,2,2.
|
|
1
| |
|
|
0, 0, 1, 1, 2, 2, 0, 0, 1, 1, 2, 2, 0, 0, 1, 1, 2, 2, 0, 0, 1, 1, 2, 2, 0, 0, 1, 1, 2, 2, 0, 0, 1, 1, 2, 2, 0, 0, 1, 1, 2, 2, 0, 0, 1, 1, 2, 2, 0, 0, 1, 1, 2, 2, 0, 0, 1, 1, 2, 2, 0, 0, 1, 1, 2, 2, 0, 0, 1, 1, 2, 2, 0, 0, 1, 1, 2, 2, 0, 0, 1, 1, 2, 2, 0, 0, 1, 1, 2, 2, 0, 0, 1, 1, 2, 2, 0, 0, 1, 1, 2, 2, 0, 0, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,5
|
|
|
LINKS
| Index entries for sequences related to linear recurrences with constant coefficients, signature (1,-1,1,-1,1).
|
|
|
FORMULA
| a(n)=(1/30)*{12*(n mod 6)+2*[(n+1) mod 6]-3*[(n+2) mod 6]+2*[(n+3) mod 6]-3*[(n+4) mod 6]+2*[(n+5) mod 6]}, with n>=0. - Paolo P. Lava, Aug 28 2007
G.f.: -(2*x^2+1)*x^2/(x-1)/(x^2+x+1)/(x^2-x+1). - R. J. Mathar, Nov 14 2007
a(n)=floor((n mod 6)/2). [From Gary Detlefs, Jul 02 2011]
|
|
|
PROG
| (PARI) a(n)=n%6\2 [From Jaume Oliver Lafont (joliverlafont(AT)gmail.com), Aug 28 2009]
|
|
|
CROSSREFS
| Cf. A105899.
Sequence in context: A141612 A050605 A060571 * A103822 A029392 A035379
Adjacent sequences: A131552 A131553 A131554 * A131556 A131557 A131558
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Paul Curtz (bpcrtz(AT)free.fr), Aug 27 2007
|
|
|
EXTENSIONS
| Edited by N. J. A. Sloane (njas(AT)research.att.com), Sep 15 2007
Formula simplified by Bruno Berselli (berselli.bruno(AT)yahoo.it), Sep 27 2010
|
| |
|
|
