A336526 a(n) is the least k > 1 such that A031121(n) = F(k*m)/F(m) for some m.

2, 3, 2, 2, 5, 2, 3, 2, 7, 3, 2, 4, 2, 9, 2, 3, 5, 4, 2, 11, 3, 2, 6, 2, 13, 5, 2, 3, 4, 7, 2, 15, 3, 2, 8, 6, 4, 2, 17, 2, 3, 5, 9, 2, 19, 7, 3, 2, 4, 10, 2, 21, 5, 2, 3, 6, 11, 8, 4, 2, 23, 3, 2, 12, 2, 25, 9, 2, 3, 4, 5, 7, 13, 6, 2, 27, 3, 2

Offset

1,1

Links

M. Farrokhi D. G., Table of n, a(n) for n = 1..999

M. Farrokhi D. G., Some remarks on the equation F_n=kF_m in Fibonacci numbers, J. Integer Seq. 10 (2007), no. 5, Article 07.5.7, 9 pp.

Crossrefs

Cf. A000045, A031121, A031122.

Sequence in context: A349387 A118665 A333238 * A225243 A207338 A027746

Adjacent sequences: A336523 A336524 A336525 * A336527 A336528 A336529

Keyword

nonn,easy

Author

M. Farrokhi D. G., Jul 25 2020

Status

approved