# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a035641
Showing 1-1 of 1

%I A035641 #15 Aug 16 2020 18:43:17
%S A035641 0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,1,3,0,0,0,1,3,6,0,0,1,3,7,11,0,1,3,7,
%T A035641 14,18,1,3,7,15,25,30,3,7,15,28,44,47,7,15,29,51,72,73,15,29,54,87,
%U A035641 116,111,29,55,94,144,180,167,55,97,159,230,276,249,98,166,259,360
%N A035641 Number of partitions of n into parts 6k and 6k+5 with at least one part of each type.
%H A035641 Robert Price, <a href="/A035641/b035641.txt">Table of n, a(n) for n = 1..1000</a>
%F A035641 G.f. : (-1 + 1/Product_{k>=0} (1 - x^(6 k + 5)))*(-1 + 1/Product_{k>=1} (1 - x^(6 k))). - _Robert Price_, Aug 12 2020
%t A035641 nmax = 75; s1 = Range[1, nmax/6]*6; s2 = Range[0, nmax/6]*6 + 5;
%t A035641 Table[Count[IntegerPartitions[n, All, s1~Join~s2],
%t A035641 x_ /; ContainsAny[x, s1 ] && ContainsAny[x, s2 ]], {n, 1, nmax}] (* _Robert Price_, Aug 12 2020 *)
%t A035641 nmax = 75; l = Rest@CoefficientList[Series[(-1 + 1/Product[(1 - x^(6 k)), {k, 1, nmax}])*(-1 + 1/Product[(1 - x^(6 k + 5)), {k, 0, nmax}]), {x, 0, nmax}], x]  (* _Robert Price_, Aug 12 2020 *)
%Y A035641 Cf. A035441-A035468, A035618-A035640, A035642-A035699.
%K A035641 nonn
%O A035641 1,17
%A A035641 _Olivier Gérard_

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE