cp's OEIS Frontend

A336767 The number of partitions of n into an even number of parts, each part occurring at most seven times, minus the number of partitions of n into an odd number of parts, each part occurring at most seven times.

%I A336767 #11 Jan 05 2025 19:51:41
%S A336767 1,-1,0,-1,1,-1,1,-1,1,-1,2,-1,2,-2,2,-3,2,-2,3,-3,3,-4,4,-4,4,-5,5,
%T A336767 -6,6,-6,7,-7,7,-8,9,-9,10,-10,11,-12,13,-13,14,-15,15,-17,18,-18,20,
%U A336767 -21,22,-23,24,-25,27,-29,30,-32,33,-35,37,-39,40,-43,45,-47,50
%N A336767 The number of partitions of n into an even number of parts, each part occurring at most seven times, minus the number of partitions of n into an odd number of parts, each part occurring at most seven times.
%H A336767 H. L. Alder and A. A. Muwafi, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/13-2/alder.pdf">Identities relating the number of partitions into an even and odd number of parts</a>, Fibonacci Quarterly, 13 (1975), 147-149.
%F A336767 G.f.: Product_{n>0} ((1-q^(8*n))/(1+q^n)).
%Y A336767 Cf. A000041, A106459, A261775, A336766.
%K A336767 sign
%O A336767 0,11
%A A336767 _Jeremy Lovejoy_, Aug 04 2020