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 A003965 #28 Dec 24 2022 03:49:11
%S A003965 1,2,3,4,5,6,8,8,9,10,13,12,21,16,15,16,34,18,55,20,24,26,89,24,25,42,
%T A003965 27,32,144,30,233,32,39,68,40,36,377,110,63,40,610,48,987,52,45,178,
%U A003965 1597,48,64,50,102,84,2584,54,65,64,165,288,4181,60,6765,466,72,64,105,78,10946
%N A003965 Fully multiplicative with a(prime(k)) = Fibonacci(k+2).
%C A003965 Numbers k such that a(k) = k are exactly 5-smooth numbers (A051037). - _Ivan Neretin_, Aug 30 2015
%H A003965 Ivan Neretin, <a href="/A003965/b003965.txt">Table of n, a(n) for n = 1..10000</a>
%F A003965 If n = Product p(k)^e(k) then a(n) = Product Fibonacci(k+2)^e(k).
%F A003965 Multiplicative with a(p^e) = A000045(A000720(p)+2)^e. - _David W. Wilson_, Aug 01 2001
%F A003965 Sum_{n>=1} 1/a(n) = 1 / A337669 = 5.269005... . - _Amiram Eldar_, Dec 24 2022
%t A003965 Table[Times @@ (Fibonacci[PrimePi[#[[1]]] + 2]^#[[2]] & /@ FactorInteger[n]), {n, 67}] (* _Ivan Neretin_, Aug 30 2015 *)
%o A003965 (PARI) a(n) = my(f=factor(n)); for (k=1, #f~, f[k,1] = fibonacci(primepi(f[k, 1])+2)); factorback(f); \\ _Michel Marcus_, Jan 14 2021
%Y A003965 Cf. A000045, A000720, A051037, A337669.
%K A003965 nonn,mult
%O A003965 1,2
%A A003965 _Marc LeBrun_, _N. J. A. Sloane_