A053029 Numbers with 4 zeros in Fibonacci numbers mod m.

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

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

Brennan Benfield and Michelle Manes, The Fibonacci Sequence is Normal Base 10, arXiv:2202.08986 [math.NT], 2022.

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