The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A053029 Numbers with 4 zeros in Fibonacci numbers mod m. 17
 5, 10, 13, 17, 25, 26, 34, 37, 50, 53, 61, 65, 73, 74, 85, 89, 97, 106, 109, 113, 122, 125, 130, 137, 146, 149, 157, 169, 170, 173, 178, 185, 193, 194, 197, 218, 221, 226, 233, 250, 257, 265, 269, 274, 277, 289, 293, 298, 305, 313, 314, 317, 325, 337, 338, 346 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Conjecture: m is on this list iff m is an odd number all of whose factors are on this list or m is twice such an odd number. A001176(a(n)) = A128924(a(n),1) = 4. - Reinhard Zumkeller, Jan 17 2014 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..1000 M. Renault, Fibonacci sequence modulo m PROG (Haskell) a053029 n = a053029_list !! (n-1) a053029_list = filter ((== 4) . a001176) [1..] -- Reinhard Zumkeller, Jan 17 2014 CROSSREFS Cf. A001176. Cf. A053030 (with 2 zeros), A053031 (with 1 zero). Sequence in context: A313394 A313395 A134961 * A313396 A282740 A313397 Adjacent sequences:  A053026 A053027 A053028 * A053030 A053031 A053032 KEYWORD nonn AUTHOR Henry Bottomley, Feb 23 2000 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 April 18 22:45 EDT 2021. Contains 343098 sequences. (Running on oeis4.)