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 A113178 #22 Jan 02 2024 00:13:12
%S A113178 0,1,2,1,5,3,13,1,2,6,89,3,233,14,7,1,1597,3,4181,6,15,90,28657,3,5,
%T A113178 234,2,14,514229,8,1346269,1,91,1598,18,3,24157817,4182,235,6,
%U A113178 165580141,16,433494437,90,7,28658,2971215073,3,13,6,1599,234
%N A113178 a(n) = Sum_{p|n} F(p), where F(p) is the p-th Fibonacci number and where the sum is over the distinct prime divisors of n.
%H A113178 Danny Rorabaugh, <a href="/A113178/b113178.txt">Table of n, a(n) for n = 1..4000</a>
%F A113178 Additive with a(p^e) = F(p).
%e A113178 12 = 2^2 * 3^1, so a(12) = F(2) + F(3) = 1 + 2 = 3.
%t A113178 b[t_]:=Fibonacci[First[t]] a[n_]:=Apply[Plus, Map[b, FactorInteger[n]]] (* Esa Peuha, Oct 26 2005 *)
%o A113178 (Sage) [0]+[sum([fibonacci(p) for p in prime_factors(n)]) for n in range(2,53)] # _Danny Rorabaugh_, Apr 03 2015
%Y A113178 Cf. A000045, A113177.
%K A113178 nonn,easy
%O A113178 1,3
%A A113178 _Leroy Quet_, Oct 16 2005
%E A113178 More terms from Esa Peuha (esa.peuha(AT)helsinki.fi), Oct 26 2005