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 A318472 #8 Aug 30 2018 08:34:38 %S A318472 1,2,2,2,2,4,2,4,2,4,2,4,2,4,4,8,2,4,2,4,4,4,2,8,2,4,4,4,2,8,2,32,4,4, %T A318472 4,4,2,4,4,8,2,8,2,4,4,4,2,16,2,4,4,4,2,8,4,8,4,4,2,8,2,4,4,256,4,8,2, %U A318472 4,4,8,2,8,2,4,4,4,4,8,2,16,8,4,2,8,4,4,4,8,2,8,4,4,4,4,4,64,2,4,4,4,2,8,2,8,8 %N A318472 Multiplicative with a(p^e) = 2^A000045(e). %H A318472 Antti Karttunen, <a href="/A318472/b318472.txt">Table of n, a(n) for n = 1..16384</a> %H A318472 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a> %F A318472 a(n) = 2^A318471(n). %o A318472 (PARI) A318472(n) = factorback(apply(e -> 2^fibonacci(e),factor(n)[,2])); %Y A318472 Cf. A000045, A318471, A318474. %K A318472 nonn,mult %O A318472 1,2 %A A318472 _Antti Karttunen_, Aug 29 2018