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!)
 A053030 Numbers with 2 zeros in Fibonacci numbers mod m. 5
 3, 6, 7, 8, 9, 12, 14, 15, 16, 18, 20, 21, 23, 24, 27, 28, 30, 32, 33, 35, 36, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 51, 52, 54, 55, 56, 57, 60, 63, 64, 66, 67, 68, 69, 70, 72, 75, 77, 78, 80, 81, 82, 83, 84, 86, 87, 88, 90, 91, 92, 93, 94, 95, 96, 98, 99, 100, 102, 103, 104 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS m is on this list iff m does not have 1 or 4 zeros in the Fibonacci sequence modulo m. A001176(a(n)) = A128924(a(n),1) = 2. - Reinhard Zumkeller, Jan 17 2014 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 M. Renault, Fibonacci sequence modulo m PROG (Haskell) a053030 n = a053030_list !! (n-1) a053030_list = filter ((== 2) . a001176) [1..] -- Reinhard Zumkeller, Jan 17 2014 CROSSREFS Cf. A001176. Cf. A053029 (with 4 zeros), A053031 (with 1 zero). Sequence in context: A047559 A288742 A113826 * A189822 A051205 A168114 Adjacent sequences:  A053027 A053028 A053029 * A053031 A053032 A053033 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 December 14 11:52 EST 2018. Contains 318097 sequences. (Running on oeis4.)