Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110549
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110549 Periodic {1,2,4,3,3,4,2,1}. +0
5
1, 2, 4, 3, 3, 4, 2, 1, 1, 2, 4, 3, 3, 4, 2, 1, 1, 2, 4, 3, 3, 4, 2, 1, 1, 2, 4, 3, 3, 4, 2, 1, 1, 2, 4, 3, 3, 4, 2, 1, 1, 2, 4, 3, 3, 4, 2, 1, 1, 2, 4, 3, 3, 4, 2, 1, 1, 2, 4, 3, 3, 4, 2, 1, 1, 2, 4, 3, 3, 4, 2, 1, 1, 2, 4, 3, 3, 4, 2, 1, 1, 2, 4, 3, 3, 4, 2, 1, 1, 2, 4, 3, 3, 4, 2, 1 (list; graph; listen)
OFFSET

0,2

COMMENT

Permutation of {1,2,3,4} followed by its reversal, repeated.

FORMULA

G.f.: (1+x+3x^2+3x^3+x^4+x^5)/(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)=cos(3*pi*n/4+pi/4)/2+(1/2-sqrt(2)/2)*sin(3*pi*n/4+pi/4)-(1/2+sqrt(2)/2)*cos(pi*n/4+pi/4) -sin(pi*n/4+pi/4)/2-cos(pi*n/2)/2+sin(pi*n/2)/2+5/2; a(n)=1+A105198(n).

a(n)=(1/56)*{5*(n mod 8)+12*[(n+1) mod 8]+19*[(n+2) mod 8]-2*[(n+3) mod 8]+5*[(n+4) mod 8]+12*[(n+5) mod 8]-9*[(n+6) mod 8]-4*[(n+7) mod 8]}, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jun 11 2007

CROSSREFS

Adjacent sequences: A110546 A110547 A110548 this_sequence A110550 A110551 A110552

Sequence in context: A099066 A021415 A137363 this_sequence A069655 A004574 A073127

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Jul 26 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified January 8 02:43 EST 2009. Contains 152824 sequences.


AT&T Labs Research