cp's OEIS Frontend

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.

A351656 Dirichlet g.f.: Product_{p prime} 1 / (1 - p^(-s) - p^(-2*s) - p^(-3*s) - p^(-4*s)).

This page as a plain text file.
%I A351656 #14 Oct 23 2023 02:01:37
%S A351656 1,1,1,2,1,1,1,4,2,1,1,2,1,1,1,8,1,2,1,2,1,1,1,4,2,1,4,2,1,1,1,15,1,1,
%T A351656 1,4,1,1,1,4,1,1,1,2,2,1,1,8,2,2,1,2,1,4,1,4,1,1,1,2,1,1,2,29,1,1,1,2,
%U A351656 1,1,1,8,1,1,2,2,1,1,1,8,8,1,1,2,1,1,1
%N A351656 Dirichlet g.f.: Product_{p prime} 1 / (1 - p^(-s) - p^(-2*s) - p^(-3*s) - p^(-4*s)).
%H A351656 Amiram Eldar, <a href="/A351656/b351656.txt">Table of n, a(n) for n = 1..10000</a>
%H A351656 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>.
%F A351656 Multiplicative with a(p^e) = A000078(e+3).
%t A351656 t[e_] := t[e] = If[e < 5, 2^(e-1), t[e-1] + t[e-2] + t[e-3] + t[e-4]]; a[1] = 1; a[n_] := Times @@ t /@ Last @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Oct 23 2023 *)
%o A351656 (PARI) for(n=1, 87, print1(direuler(p=2, n, 1/(1 - X - X^2 - X^3 - X^4))[n], ", "))
%Y A351656 Cf. A000078, A351219, A351346, A351347, A351348, A351655.
%K A351656 nonn,mult
%O A351656 1,4
%A A351656 _Ilya Gutkovskiy_, Feb 16 2022