login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105471 Fibonacci(n) mod 100. 2
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 44, 33, 77, 10, 87, 97, 84, 81, 65, 46, 11, 57, 68, 25, 93, 18, 11, 29, 40, 69, 9, 78, 87, 65, 52, 17, 69, 86, 55, 41, 96, 37, 33, 70, 3, 73, 76, 49, 25, 74, 99, 73, 72, 45, 17, 62, 79, 41, 20, 61, 81, 42, 23, 65, 88, 53, 41, 94, 35, 29, 64 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

COMMENTS

a(n) = A105472(n)*10 + A003893(n);

the sequence is periodic with period 300; all blocks of 60 successive terms contain 20 even and 40 odd numbers, see A003893.

FORMULA

a(n) = (a(n-1) + a(n-2)) mod 100 for n>1, a(0) = 0, a(1) = 1.

MATHEMATICA

a={}; Do[f=Fibonacci[n]; AppendTo[a, Mod[f, 100]], {n, 1, 30}]; a (Vladimir Orlovsky, Jul 23 2008)

CROSSREFS

Cf. A000045.

Sequence in context: A096275 A093089 A093091 * A189722 A023441 A023442

Adjacent sequences:  A105468 A105469 A105470 * A105472 A105473 A105474

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 09 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 07:41 EST 2012. Contains 205998 sequences.