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 A035684 #17 Jan 03 2025 20:53:14
%S A035684 0,0,0,0,0,0,0,1,1,1,1,1,1,1,2,4,4,4,4,4,4,5,7,10,11,11,11,11,12,14,
%T A035684 18,23,25,26,26,27,29,33,40,47,52,54,56,58,62,70,81,93,101,107,111,
%U A035684 116,124,137,155,172,188,199,208,218,233,255,282,311,336,357,374,393
%N A035684 Number of partitions of n into parts 8k+1 and 8k+7 with at least one part of each type.
%H A035684 Alois P. Heinz, <a href="/A035684/b035684.txt">Table of n, a(n) for n = 1..5000</a>
%F A035684 G.f.: (-1 + 1/Product_{k>=0} (1 - x^(8*k + 1)))*(-1 + 1/Product_{k>=0} (1 - x^(8*k + 7))). - _Robert Price_, Aug 15 2020
%t A035684 nmax = 68; s1 = Range[0, nmax/8]*8 + 1; s2 = Range[0, nmax/8]*8 + 7;
%t A035684 Table[Count[IntegerPartitions[n, All, s1~Join~s2], x_ /; ContainsAny[x, s1 ] && ContainsAny[x, s2 ]], {n, 1, nmax}] (* _Robert Price_, Aug 15 2020 *)
%t A035684 nmax = 68; l = Rest@CoefficientList[Series[(-1 + 1/Product[(1 - x^(8 k + 1)), {k, 0, nmax}])*(-1 + 1/Product[(1 - x^(8 k + 7)), {k, 0, nmax}]), {x, 0, nmax}], x] (* _Robert Price_, Aug 15 2020*)
%Y A035684 Cf. A035441-A035468, A035618-A035683, A035685-A035699.
%K A035684 nonn
%O A035684 1,15
%A A035684 _Olivier Gérard_