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 A035638 #15 Aug 16 2020 18:37:41
%S A035638 0,0,0,0,0,0,0,1,0,1,0,1,0,4,0,4,0,4,0,10,0,11,0,11,0,22,0,25,0,26,0,
%T A035638 44,0,51,0,54,0,84,0,98,0,105,0,152,0,178,0,193,0,266,0,312,0,341,0,
%U A035638 452,0,528,0,581,0,749,0,873,0,964,0,1214,0,1409,0,1561,0,1930,0,2234
%N A035638 Number of partitions of n into parts 6k and 6k+2 with at least one part of each type.
%H A035638 Robert Price, <a href="/A035638/b035638.txt">Table of n, a(n) for n = 1..1000</a>
%F A035638 G.f. : (-1 + 1/Product_{k>=0} (1 - x^(6 k + 2)))*(-1 + 1/Product_{k>=1} (1 - x^(6 k))). - _Robert Price_, Aug 12 2020
%t A035638 nmax = 76; s1 = Range[1, nmax/6]*6; s2 = Range[0, nmax/6]*6 + 2;
%t A035638 Table[Count[IntegerPartitions[n, All, s1~Join~s2],
%t A035638 x_ /; ContainsAny[x, s1 ] && ContainsAny[x, s2 ]], {n, 1, nmax}] (* _Robert Price_, Aug 12 2020 *)
%t A035638 nmax = 76; l = Rest@CoefficientList[Series[(-1 + 1/Product[(1 - x^(6 k)), {k, 1, nmax}])*(-1 + 1/Product[(1 - x^(6 k + 2)), {k, 0, nmax}]), {x, 0, nmax}], x] (* _Robert Price_, Aug 12 2020 *)
%Y A035638 Cf. A035441-A035468, A035618-A035637, A035639-A035699.
%K A035638 nonn
%O A035638 1,14
%A A035638 _Olivier Gérard_