This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A235715 a(n) = number of times (n-1) occurs in the fundamental period of Fibonacci numbers modulo n. 3
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(n) = A128924(n,n). LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 PROG (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 CROSSREFS Cf. A001176, A001175. Sequence in context: A265755 A046671 A178760 * A129566 A073809 A303648 Adjacent sequences:  A235712 A235713 A235714 * A235716 A235717 A235718 KEYWORD nonn AUTHOR Reinhard Zumkeller, Jan 17 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 16 05:59 EST 2018. Contains 318158 sequences. (Running on oeis4.)