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 A072397 #14 Feb 03 2023 01:33:07 %S A072397 2,21,8,6765,2584,144,832040,86267571272,46368,14930352, %T A072397 30960598847965113057878492344,4807526976,160500643816367088, %U A072397 498454011879264,16641027750620563662096,51680708854858323072,34507973060837282187130139035400899082304280 %N A072397 Smallest Fibonacci number with n prime factors when counted with multiplicity. %H A072397 Hisanori Mishima, <a href="http://www.asahi-net.or.jp/~KC2H-MSM/mathland/matha1/matha108.htm">Fibonacci numbers (n = 1 to 100)</a>. %H A072397 Hisanori Mishima, <a href="http://www.asahi-net.or.jp/~KC2H-MSM/mathland/matha1/matha109.htm">Fibonacci numbers (n = 101 to 200)</a>. %H A072397 Hisanori Mishima, <a href="http://www.asahi-net.or.jp/~KC2H-MSM/mathland/matha1/matha110.htm">Fibonacci numbers (n = 201 to 300)</a>. %H A072397 Hisanori Mishima, <a href="http://www.asahi-net.or.jp/~KC2H-MSM/mathland/matha1/matha111.htm">Fibonacci numbers (n = 301 to 400)</a>. %H A072397 Hisanori Mishima, <a href="http://www.asahi-net.or.jp/~KC2H-MSM/mathland/matha1/matha112.htm">Fibonacci numbers (n = 401 to 480)</a>. %F A072397 a(n) = A000045(A072396(n)). - _Alois P. Heinz_, Apr 10 2018 %e A072397 21 is the 2nd term because 21 is the smallest Fibonacci number having 2 prime factors. %Y A072397 Cf. A000045, A072396. %Y A072397 Row n=1 of A303216. %K A072397 nonn %O A072397 1,1 %A A072397 _Shyam Sunder Gupta_, Jul 21 2002 %E A072397 a(17) from _Alois P. Heinz_, Apr 10 2018