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!)
 A233284 a(n) = largest m such that 1, 2, ..., m divide n-th Fibonacci number; a(n) = A055874(A000045(n)). 5
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 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. Sequence in context: A029322 A152828 A233285 * A112195 A103956 A103957 Adjacent sequences:  A233281 A233282 A233283 * A233285 A233286 A233287 KEYWORD nonn AUTHOR Antti Karttunen, Dec 12 2013 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 September 28 18:42 EDT 2021. Contains 347717 sequences. (Running on oeis4.)