Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105471
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105471 Fibonacci(n) mod 100. +0
3
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; listen)
OFFSET

0,4

COMMENT

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 this_sequence A023441 A023442 A000044

Adjacent sequences: A105468 A105469 A105470 this_sequence A105472 A105473 A105474

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 09 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 December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research