Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,2

FORMULA

G.f.: (1+2x+3x^2+2x^3+x^4)/(1-x+x^2-x^3+x^4-x^5); a(n)=a(n-1)-a(n-2)+a(n-3)-a(n-4)+a(n-5); a(n)=3+2*sin(pi*n/3)/sqrt(3)-2*cos(pi*n/3); a(n)=mod(A001045(n+2), 6).

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

CROSSREFS

Cf. A110549, A105198, A110550.

Sequence in context: A077860 A078063 A019944 this_sequence A141334 A129488 A053670

Adjacent sequences: A110548 A110549 A110550 this_sequence A110552 A110553 A110554

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research