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 A318474 #13 Sep 23 2018 21:30:27 %S A318474 1,2,2,4,2,4,2,8,4,4,2,8,2,4,4,32,2,8,2,8,4,4,2,16,4,4,8,8,2,8,2,256, %T A318474 4,4,4,16,2,4,4,16,2,8,2,8,8,4,2,64,4,8,4,8,2,16,4,16,4,4,2,16,2,4,8, %U A318474 8192,4,8,2,8,4,8,2,32,2,4,8,8,4,8,2,64,32,4,2,16,4,4,4,16,2,16,4,8,4,4,4,512,2,8,8,16,2,8,2,16,8 %N A318474 Multiplicative with a(p^e) = 2^A000045(e+1). %H A318474 Antti Karttunen, <a href="/A318474/b318474.txt">Table of n, a(n) for n = 1..16384</a> %H A318474 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a> %F A318474 a(n) = 2^A318473(n). %F A318474 a(n) = A318472(A064549(n)). %F A318474 a(A064549(n)) = a(n)*A318472(n). %t A318474 Array[Apply[Times, 2^Fibonacci[# + 1] & /@ FactorInteger[#][[All, -1]]] - Boole[# == 1] &, 105] (* _Michael De Vlieger_, Sep 02 2018 *) %o A318474 (PARI) A318474(n) = factorback(apply(e -> 2^fibonacci(1+e),factor(n)[,2])); %Y A318474 Cf. A000045, A318465, A318472, A318473. %K A318474 nonn,mult %O A318474 1,2 %A A318474 _Antti Karttunen_, Aug 29 2018