This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A336526 #19 Sep 12 2020 23:52:40 %S A336526 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, %T A336526 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, %U A336526 2,25,9,2,3,4,5,7,13,6,2,27,3,2 %N A336526 a(n) is the least k > 1 such that A031121(n) = F(k*m)/F(m) for some m. %H A336526 M. Farrokhi D. G., <a href="/A336526/b336526.txt">Table of n, a(n) for n = 1..999</a> %H A336526 M. Farrokhi D. G., <a href="https://cs.uwaterloo.ca/journals/JIS/VOL10/Farrokhi/farrokhi20.html">Some remarks on the equation F_n=kF_m in Fibonacci numbers</a>, J. Integer Seq. 10 (2007), no. 5, Article 07.5.7, 9 pp. %Y A336526 Cf. A000045, A031121, A031122. %K A336526 nonn,easy %O A336526 1,1 %A A336526 _M. Farrokhi D. G._, Jul 25 2020