|
Search: id:A110550
|
|
|
| A110550 |
|
Periodic {1,3,2,4,4,2,3,1}. |
|
+0
4
|
|
| 1, 3, 2, 4, 4, 2, 3, 1, 1, 3, 2, 4, 4, 2, 3, 1, 1, 3, 2, 4, 4, 2, 3, 1, 1, 3, 2, 4, 4, 2, 3, 1, 1, 3, 2, 4, 4, 2, 3, 1, 1, 3, 2, 4, 4, 2, 3, 1, 1, 3, 2, 4, 4, 2, 3, 1, 1, 3, 2, 4, 4, 2, 3, 1, 1, 3, 2, 4, 4, 2, 3, 1, 1, 3, 2, 4, 4, 2, 3, 1, 1, 3, 2, 4, 4, 2, 3, 1, 1, 3, 2, 4, 4, 2, 3, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Permutation of {1,2,3,4} followed by its reversal, repeated.
|
|
FORMULA
|
G.f.: (1+2x+4x^3+2x^5+x^6)/(1-x+x^2-x^3+x^4-x^5+x^6-x^7); a(n)=a(n-1)-a(n-2)+a(n-3)-a(n-4)+a(n-5)-a(n-6)+a(n-7).
a(n)=(1/15)*{5*(n mod 8)+19*[(n+1) mod 8]-2*[(n+2) mod 8]+19*[(n+3) mod 8]+5*[(n+4) mod 8]-9*[(n+5) mod 8]+12*[(n+5) mod 8]-9*[(n+5) mod 8]}, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jun 11 2007
|
|
CROSSREFS
|
Cf. A110549, A105198.
Adjacent sequences: A110547 A110548 A110549 this_sequence A110551 A110552 A110553
Sequence in context: A062964 A010270 A023630 this_sequence A128220 A134749 A061901
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Paul Barry (pbarry(AT)wit.ie), Jul 26 2005
|
|
|
Search completed in 0.002 seconds
|
