A105471 a(n) = Fibonacci(n) mod 100.

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

Offset: 0

Author

Reinhard Zumkeller, Apr 09 2005

Keywords

• nonn
• easy

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.

Links

• Vincenzo Librandi, Table of n, a(n) for n = 0..1000
• Index entries for linear recurrences with constant coefficients, order 300.

Crossrefs

Cf. A000045, A003893, A105472.

Programs

Haskell

a105471 n = a105471_list !! n
a105471_list = 0 : 1 :
   zipWith ((flip mod 100 .) . (+)) a105471_list (tail a105471_list)
-- Reinhard Zumkeller, Aug 06 2014

Magma

[Fibonacci(n) mod(100): n in [0..75]]; // Vincenzo Librandi, Jul 23 2014

Mathematica

Mod[Fibonacci[Range[0,100]],100] (* Harvey P. Dale, Jun 12 2014 *)

PARI

a(n)=fibonacci(n%300)%100 \\ Charles R Greathouse IV, Oct 07 2015

Formula

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