A261606 a(n) = Fibonacci(n) mod 60.
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 29, 24, 53, 17, 10, 27, 37, 4, 41, 45, 26, 11, 37, 48, 25, 13, 38, 51, 29, 20, 49, 9, 58, 7, 5, 12, 17, 29, 46, 15, 1, 16, 17, 33, 50, 23, 13, 36, 49, 25, 14, 39, 53, 32, 25, 57, 22, 19, 41, 0, 41, 41, 22, 3, 25, 28, 53
Offset: 0
Links
- Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
- Eric Weisstein's World of Mathematics, Sexagesimal
- Wikipedia, Sexagesimal
Programs
-
Haskell
a261606 n = a261606_list !! n a261606_list = 0 : 1 : map (flip mod 60) (zipWith (+) a261606_list $ tail a261606_list)
-
Mathematica
Mod[Fibonacci[Range[67]], 60] (* Michael De Vlieger, Jan 22 2022 *)
-
PARI
a(n) = fibonacci(n) % 60; \\ Michel Marcus, Jan 22 2022
Formula
a(0) = 0, a(1) = 1 and for n > 1: a(n) = (a(n-1) + a(n-2)) mod 60.
Comments