1280460

Appears in sequences

• a(n) is the number of zeros needed to write the integers 1 through Fibonacci(n).at n=31A155881
• Integers n such that for every integer k>0, n*6^k-1 has a divisor in the set { 7, 13, 31, 37, 43 }.at n=8A244211