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 A091394 #14 Oct 17 2022 07:05:45
%S A091394 1,0,2,0,1,0,2,0,2,0,0,0,0,0,2,0,0,0,0,0,4,0,2,0,1,0,2,0,2,0,0,0,0,0,
%T A091394 2,0,0,0,0,0,2,0,2,0,2,0,2,0,2,0,0,0,0,0,0,0,0,0,0,0,2,0,4,0,0,0,2,0,
%U A091394 4,0,0,0,0,0,2,0,0,0,0,0,2,0,2,0,0,0,4,0,2,0,0,0,0,0,0,0,0,0,0,0,2,0,2,0,4
%N A091394 a(n) = Product_{ p | n } (1 + Legendre(-5,p) ).
%H A091394 Andrew Howroyd, <a href="/A091394/b091394.txt">Table of n, a(n) for n = 1..1000</a>
%F A091394 Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 5*sqrt(5)/(6*Pi) = 0.593135 . - _Amiram Eldar_, Oct 17 2022
%p A091394 with(numtheory); L := proc(n,N) local i,t1,t2; t1 := ifactors(n)[2]; t2 := mul((1+legendre(N,t1[i][1])),i=1..nops(t1)); end; [seq(L(n,-5),n=1..120)];
%t A091394 a[n_] := Times@@ (1+KroneckerSymbol[-5, #]& /@ FactorInteger[n][[All, 1]]);
%t A091394 Array[a, 105] (* _Jean-François Alcover_, Apr 08 2020 *)
%o A091394 (PARI) a(n)={my(f=factor(n)[, 1]); prod(i=1, #f, 1 + kronecker(-5, f[i]))} \\ _Andrew Howroyd_, Jul 25 2018
%Y A091394 Cf. A091379, A226162.
%K A091394 nonn,mult
%O A091394 1,3
%A A091394 _N. J. A. Sloane_, Mar 02 2004