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 A035632 #15 Aug 16 2020 17:15:24
%S A035632 0,0,0,1,1,1,2,2,4,5,5,7,8,11,14,15,19,22,27,33,37,44,50,59,71,79,93,
%T A035632 106,120,142,159,181,207,232,267,301,339,383,428,486,544,609,683,758,
%U A035632 853,951,1056,1180,1304,1453,1616,1785,1980,2185,2417,2674,2947,3253
%N A035632 Number of partitions of n into parts 5k+1 and 5k+3 with at least one part of each type.
%H A035632 Robert Price, <a href="/A035632/b035632.txt">Table of n, a(n) for n = 1..1000</a>
%F A035632 G.f.: (-1 + 1/Product_{k>=0} (1 - x^(5 k + 1)))*(-1 + 1/Product_{k>=0} (1 - x^(5 k + 3))). - _Robert Price_, Aug 16 2020
%t A035632 nmax = 58; s1 = Range[0, nmax/5]*5 + 1; s2 = Range[0, nmax/5]*5 + 3;
%t A035632 Table[Count[IntegerPartitions[n, All, s1~Join~s2],
%t A035632 x_ /; ContainsAny[x, s1 ] && ContainsAny[x, s2 ]], {n, 1, nmax}] (* _Robert Price_, Aug 07 2020 *)
%t A035632 nmax = 58; l = Rest@CoefficientList[Series[(-1 + 1/Product[(1 - x^(5 k + 1)), {k, 0, nmax}])*(-1 + 1/Product[(1 - x^(5 k + 3)), {k, 0, nmax}]), {x, 0, nmax}], x] (* _Robert Price_, Aug 16 2020 *)
%Y A035632 Cf. A035441-A035468, A035618-A035631, A035633-A035699.
%K A035632 nonn
%O A035632 1,7
%A A035632 _Olivier Gérard_