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 A351655 #17 Oct 17 2023 05:24:00
%S A351655 1,1,1,2,1,1,1,4,2,1,1,2,1,1,1,7,1,2,1,2,1,1,1,4,2,1,4,2,1,1,1,13,1,1,
%T A351655 1,4,1,1,1,4,1,1,1,2,2,1,1,7,2,2,1,2,1,4,1,4,1,1,1,2,1,1,2,24,1,1,1,2,
%U A351655 1,1,1,8,1,1,2,2,1,1,1,7,7,1,1,2,1,1,1
%N A351655 Dirichlet g.f.: Product_{p prime} 1 / (1 - p^(-s) - p^(-2*s) - p^(-3*s)).
%H A351655 Amiram Eldar, <a href="/A351655/b351655.txt">Table of n, a(n) for n = 1..10000</a>
%H A351655 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>.
%F A351655 Multiplicative with a(p^e) = A000073(e+2).
%t A351655 t[n_] := t[n] = t[n-1] + t[n-2] + t[n-3]; t[0] = t[1] = 0; t[2] = 1; f[p_, e_] := t[e+2]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Sep 18 2023 *)
%o A351655 (PARI) for(n=1, 87, print1(direuler(p=2, n, 1/(1 - X - X^2 - X^3))[n], ", "))
%Y A351655 Cf. A000073, A351219, A351346, A351347, A351348, A351656.
%K A351655 nonn,easy,mult
%O A351655 1,4
%A A351655 _Ilya Gutkovskiy_, Feb 16 2022