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 A363877 #11 Jun 25 2023 10:40:51
%S A363877 0,1,0,0,1,1,0,1,0,1,1,0,0,2,0,1,1,1,0,1,0,1,1,0,0,3,1,0,1,1,0,1,0,1,
%T A363877 1,1,0,3,0,0,1,1,0,2,0,2,1,0,1,2,0,0,1,1,0,2,0,1,1,1,1,3,0,0,1,2,0,1,
%U A363877 0,1,2,0,0,2,0,1,1,2,0,2,0,2,1,0,0,4,0,0,1,1,0,1,1,1,2,1,0,3,0,0
%N A363877 Number of divisors of 7*n-2 of form 7*k+3.
%C A363877 Also number of divisors of 7*n-2 of form 7*k+4.
%F A363877 a(n) = A363805(7*n-2) = A363806(7*n-2).
%F A363877 G.f.: Sum_{k>0} x^(4*k-2)/(1 - x^(7*k-4)).
%F A363877 G.f.: Sum_{k>0} x^(3*k-1)/(1 - x^(7*k-3)).
%t A363877 a[n_] := DivisorSum[7*n - 2, 1 &, Mod[#, 7] == 3 &]; Array[a, 100] (* _Amiram Eldar_, Jun 25 2023 *)
%o A363877 (PARI) a(n) = sumdiv(7*n-2, d, d%7==3);
%Y A363877 Cf. A363805, A353806.
%K A363877 nonn
%O A363877 1,14
%A A363877 _Seiichi Manyama_, Jun 25 2023