Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079343
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079343 F(n) mod 4, where F(n)=A000045(n) is the n-th Fibonacci number. +0
9
0, 1, 1, 2, 3, 1, 0, 1, 1, 2, 3, 1, 0, 1, 1, 2, 3, 1, 0, 1, 1, 2, 3, 1, 0, 1, 1, 2, 3, 1, 0, 1, 1, 2, 3, 1, 0, 1, 1, 2, 3, 1, 0, 1, 1, 2, 3, 1, 0, 1, 1, 2, 3, 1, 0, 1, 1, 2, 3, 1, 0, 1, 1, 2, 3, 1, 0, 1, 1, 2, 3, 1, 0, 1, 1, 2, 3, 1, 0, 1, 1, 2, 3, 1, 0, 1, 1, 2, 3, 1, 0, 1, 1, 2, 3, 1, 0, 1, 1, 2, 3, 1, 0, 1, 1 (list; graph; listen)
OFFSET

0,4

COMMENT

Periodic with period of length 6 = (0,1,1,2,3,1). - Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 05 2003

FORMULA

a(n)=(1/90)*{23*[n mod 6]+38*[(n+1) mod 6]-7*[(n+2) mod 6]-7*[(n+3) mod 6]+8*[(n+4) mod 6]-7*[(n+5) mod 6]}, with n>=0. - Paolo P. Lava (ppl(AT)spl.at), May 30 2007

EXAMPLE

a(6) = F(6) mod 4 = 8 mod 4 = 0.

MATHEMATICA

f[n_]:=Mod[Fibonacci[n], 4]; lst={}; Do[AppendTo[lst, f[n]], {n, 0, 6!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Feb 18 2010]

PROGRAM

(PARI) for (n=0, 100, print1(fibonacci(n)%4", "))

CROSSREFS

Cf. A079344, A079345.

Sequence in context: A124314 A059087 A030373 this_sequence A004566 A050074 A006705

Adjacent sequences: A079340 A079341 A079342 this_sequence A079344 A079345 A079346

KEYWORD

nonn,new

AUTHOR

Jon Perry (perry(AT)globalnet.co.uk), Jan 04 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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 16 18:11 EDT 2010. Contains 173532 sequences.


AT&T Labs Research