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 A318471 #14 Oct 09 2023 02:17:30
%S A318471 0,1,1,1,1,2,1,2,1,2,1,2,1,2,2,3,1,2,1,2,2,2,1,3,1,2,2,2,1,3,1,5,2,2,
%T A318471 2,2,1,2,2,3,1,3,1,2,2,2,1,4,1,2,2,2,1,3,2,3,2,2,1,3,1,2,2,8,2,3,1,2,
%U A318471 2,3,1,3,1,2,2,2,2,3,1,4,3,2,1,3,2,2,2,3,1,3,2,2,2,2,2,6,1,2,2,2,1,3,1,3,3
%N A318471 Additive with a(p^e) = A000045(e).
%H A318471 Antti Karttunen, <a href="/A318471/b318471.txt">Table of n, a(n) for n = 1..65537</a>
%H A318471 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>.
%F A318471 a(n) = A007814(A318472(n)).
%F A318471 Sum_{k=1..n} a(k) ~ n * (log(log(n)) + B + C), where B is Mertens's constant (A077761) and C = Sum_{k>=3} Fibonacci(k-2) * P(k) = 0.58264195290963042938..., where P(s) is the prime zeta function. - _Amiram Eldar_, Oct 09 2023
%t A318471 a[n_] := Total@ Fibonacci[FactorInteger[n][[;; , 2]]]; a[1] = 0; Array[a, 100] (* _Amiram Eldar_, May 15 2023 *)
%o A318471 (PARI) A318471(n) = vecsum(apply(e -> fibonacci(e),factor(n)[,2]));
%Y A318471 Cf. A000045, A077761, A318472, A318473.
%K A318471 nonn,easy
%O A318471 1,6
%A A318471 _Antti Karttunen_, Aug 29 2018