Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082115
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082115 Fibonacci sequence (mod 3). +0
6
1, 1, 2, 0, 2, 2, 1, 0, 1, 1, 2, 0, 2, 2, 1, 0, 1, 1, 2, 0, 2, 2, 1, 0, 1, 1, 2, 0, 2, 2, 1, 0, 1, 1, 2, 0, 2, 2, 1, 0, 1, 1, 2, 0, 2, 2, 1, 0, 1, 1, 2, 0, 2, 2, 1, 0, 1, 1, 2, 0, 2, 2, 1, 0, 1, 1, 2, 0, 2, 2, 1, 0, 1, 1, 2, 0, 2, 2, 1, 0, 1, 1, 2, 0, 2, 2, 1, 0, 1, 1, 2, 0, 2, 2, 1, 0, 1, 1, 2, 0, 2, 2 (list; graph; listen)
OFFSET

1,3

LINKS

Eric Weisstein's World of Mathematics, Fibonacci Number

FORMULA

Sequence is periodic with Pisano period 8.

a(n)=(1/224)*{-19*(n mod 8)+37*[(n+1) mod 8]+37*[(n+2) mod 8]+9*[(n+3) mod 8]-47*[(n+4) mod 8]+65*[(n+5) mod 8]-19*[(n+6) mod 8]+9*[(n+7) mod 8]} - Paolo P. Lava (ppl(AT)spl.at), Nov 21 2006

a(n)=1-floor(n/8)+floor((n-1)/8)+floor((n-3)/8)-2*floor((n-4)/8)+2*floo= r((n-5)/8)-floor((n-7)/8). - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jul 01 2007

a(n)=1+((n mod 8)+((n+1)mod 8)-2*((n+3)mod 8)+2*((n+4)mod = 8)-((n+5)mod 8)-((n+7)mod 8))/8. - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jul 01 2007

G.f.: g(x)=(x+x^2+2x^3+2x^5+2x^6+x^7)/(1-x^8) - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jul 01 2007

a(n)=A131295(n) mod 3 (for n>0). - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jul 01 2007

CROSSREFS

Cf. A011655, A082115, A079343, A082116, A082117, A082118, A079344.

Adjacent sequences: A082112 A082113 A082114 this_sequence A082116 A082117 A082118

Sequence in context: A121363 A139137 A076880 this_sequence A099751 A058728 A059581

KEYWORD

nonn

AUTHOR

Eric Weisstein (eric(AT)weisstein.com), Apr 03, 2003

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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research