A235715 a(n) = number of times (n-1) occurs in the fundamental period of Fibonacci numbers modulo n.

1, 2, 3, 1, 4, 6, 4, 1, 5, 8, 1, 1, 4, 8, 3, 1, 4, 4, 1, 2, 1, 2, 4, 1, 4, 8, 8, 2, 1, 6, 1, 1, 1, 4, 4, 1, 4, 1, 3, 1, 4, 2, 4, 1, 5, 4, 4, 1, 4, 8, 3, 2, 4, 8, 1, 2, 1, 2, 1, 1, 4, 1, 3, 1, 4, 2, 4, 1, 1, 8, 1, 1, 4, 8, 3, 1, 2, 6, 1, 1, 8, 8, 4, 1, 4, 8

Offset: 1

Author

Reinhard Zumkeller, Jan 17 2014

Keywords

• nonn

Comments

a(n) = A128924(n,n).

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A001176, A001175.

Programs

Haskell

a235715 1 = 1
a235715 n = f 1 ps 0 where
   f 0 (1 : xs) z = z
   f _ (x : xs) z = f x xs (z + 0 ^ (n - 1 - x))
   ps = 1 : 1 : zipWith (\u v -> (u + v) `mod` n) (tail ps) ps