A233284 a(n) = largest m such that 1, 2, ..., m divide n-th Fibonacci number; a(n) = A055874(A000045(n)).

1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 4, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 4, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 4, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 4, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 6, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 4, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 4, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 4, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 4, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 12

Offset: 1

Author

Antti Karttunen, Dec 12 2013

Keywords

• nonn

Comments

It seems that the records occur at the positions given by A233283: 1, 3, 12, 60, 120, 840, 2520, 12600, ...

The corresponding record values begin as 1, 2, 4, 6, 12, 16, 24, 36, ... (maybe A007416?).

Links

• Antti Karttunen, Table of n, a(n) for n = 1..12600

Crossrefs

Differs from A233285 for the first time at n=120, where a(120)=12, while A233285(120)=7.

Cf. A055874, A000045, A001175-A001177, A233283, A007416.