|
Search: id:A131079
|
|
|
| A131079 |
|
Periodic sequence (2, 2, 2, 1, 0, 0, 0, 1). |
|
+0
6
|
|
| 2, 2, 2, 1, 0, 0, 0, 1, 2, 2, 2, 1, 0, 0, 0, 1, 2, 2, 2, 1, 0, 0, 0, 1, 2, 2, 2, 1, 0, 0, 0, 1, 2, 2, 2, 1, 0, 0, 0, 1, 2, 2, 2, 1, 0, 0, 0, 1, 2, 2, 2, 1, 0, 0, 0, 1, 2, 2, 2, 1, 0, 0, 0, 1, 2, 2, 2, 1, 0, 0, 0, 1, 2, 2, 2, 1, 0, 0, 0, 1, 2, 2, 2, 1, 0, 0, 0, 1, 2, 2, 2, 1, 0, 0, 0, 1, 2, 2, 2, 1, 0, 0, 0, 1, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Second column of triangular array T defined in A131074.
|
|
FORMULA
|
a(1) = a(2) = a(3) = 2, a(4) = 1, a(5) = a(6) = a(7) = 0, a(8) = 1; for n > 8, a(n) = a(n-8).
G.f.: (2-x^3+x^4)/((1-x)*(1+x^4)).
a(n)=1/56*{-5*(n mod 8)-5*[(n+1) mod 8]+2*[(n+2) mod 8]+2*[(n+3) mod 8]+9*[(n+4) mod 8]+9*[(n+5) mod 8]+2*[(n+6) mod 8]+2*[(n+7) mod 8]}, with n>=0. - Paolo P. Lava (ppl(AT)spl.at), Jun 19 2007
|
|
PROGRAM
|
(PARI) {m=105; for(n=1, m, r=(n-1)%8; print1(if(r<3, 2, if(r==3||r==7, 1, 0)), ", "))}
(MAGMA) m:=105; [ [2, 2, 2, 1, 0, 0, 0, 1][(n-1) mod 8 + 1]: n in [1..m] ];
|
|
CROSSREFS
|
Cf. A131074, A131026.
Sequence in context: A011139 A136663 A165490 this_sequence A078336 A076441 A124747
Adjacent sequences: A131076 A131077 A131078 this_sequence A131080 A131081 A131082
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), following a suggestion of Paul Curtz (bpcrtz(AT)free.fr), Jun 14 2007
|
|
|
Search completed in 0.002 seconds
|
