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 A035672 #17 Aug 17 2020 07:29:09
%S A035672 0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,4,4,4,4,4,4,4,4,10,11,11,11,11,11,11,
%T A035672 11,22,25,26,26,26,26,26,26,44,51,54,55,55,55,55,55,84,98,105,108,109,
%U A035672 109,109,109,153,178,193,200,203,204,204,204,270,313,341,356,363,366
%N A035672 Number of partitions of n into parts 8k and 8k+1 with at least one part of each type.
%H A035672 Robert Price, <a href="/A035672/b035672.txt">Table of n, a(n) for n = 1..1000</a>
%F A035672 G.f.: (-1 + 1/Product_{k>=0} (1 - x^(8*k + 1)))*(-1 + 1/Product_{k>=1} (1 - x^(8*k))). - _Robert Price_, Aug 12 2020
%t A035672 nmax = 70; s1 = Range[1, nmax/8]*8; s2 = Range[0, nmax/8]*8 + 1;
%t A035672 Table[Count[IntegerPartitions[n, All, s1~Join~s2],
%t A035672 x_ /; ContainsAny[x, s1 ] && ContainsAny[x, s2 ]], {n, 1, nmax}] (* _Robert Price_, Aug 12 2020 *)
%t A035672 nmax = 70; l = Rest@CoefficientList[Series[(-1 + 1/Product[(1 - x^(8 k)), {k, 1, nmax}])*(-1 + 1/Product[(1 - x^(8 k + 1)), {k, 0, nmax}]), {x, 0, nmax}], x] (* _Robert Price_, Aug 12 2020 *)
%Y A035672 Cf. A035441-A035468, A035618-A035671, A035673-A035699.
%K A035672 nonn
%O A035672 1,17
%A A035672 _Olivier Gérard_