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 A081979 #19 Jun 08 2024 00:01:21 %S A081979 2,8,75025,610 %N A081979 Smallest Fibonacci number with 2n divisors, or 0 if no such number exists. %C A081979 Further known terms are a(12)=A000045(91); a(16)=A000045(44); a(24)=A000045(50); a(32)=A000045(30); a(36)=A000045(24); a(48)=A000045(56); a(64)=A000045(54); a(80)=A000045(36); a(96)=A000045(182); a(128)=A000045(128); a(168)=A000045(48); a(192)=A000045(110); a(256)=A000045(80), ..., a(688128)=A000045(240) from the Kelly factorizations. - _R. J. Mathar_, Apr 05 2007 %C A081979 For n prime, a(n) = q*p^(n-1) or p^(2n-1) for some primes p and q since those are the only numbers with 2*n divisors. a(8) = 2584. - _Chai Wah Wu_, Dec 08 2014 %C A081979 The sequence is restricted to even numbers of divisors since 1 and 144 are the only Fibonacci numbers with an odd number of divisors (because they are the only positive Fibonacci numbers that are squares, see A227875). - _Amiram Eldar_, Jul 02 2023 %H A081979 Blair Kelly, <a href="http://mersennus.net/fibonacci//">Fibonacci Factorizations</a>. %e A081979 a(2) = 8 because 8 is the smallest Fibonacci number with 4 divisors (1,2,4,8). %Y A081979 Cf. A000045, A081978, A227875. %K A081979 nonn,more %O A081979 1,1 %A A081979 _Amarnath Murthy_, Apr 03 2003 %E A081979 Corrected by _Emeric Deutsch_, Apr 19 2005