cp's OEIS Frontend

A026924 Number of partitions of n into an odd number of parts, the greatest being 4; also, a(n+7) = number of partitions of n+3 into an even number of parts, each <=4.

%I A026924 #9 Aug 22 2019 08:18:44
%S A026924 0,0,0,1,0,1,1,3,3,5,5,8,8,12,13,18,19,24,26,33,35,43,46,55,59,69,74,
%T A026924 86,91,104,111,126,134,150,159,177,187,207,219,241,254,277,292,318,
%U A026924 334,362,380,410,430,462,484,519,542,579,605
%N A026924 Number of partitions of n into an odd number of parts, the greatest being 4; also, a(n+7) = number of partitions of n+3 into an even number of parts, each <=4.
%H A026924 R. J. Mathar, <a href="/A026924/b026924.txt">Table of n, a(n) for n = 1..394</a>
%F A026924 a(n) + A026928(n) = A026810(n). - _R. J. Mathar_, Aug 22 2019
%p A026924 A026924 := proc(n)
%p A026924     local a,p1,p2,p3,p4 ;
%p A026924     a := 0 ;
%p A026924     for p1 from 0 to n do
%p A026924         for p2 from 0 to (n-p1)/2 do
%p A026924             for p3 from op(1+modp(n-p1-2*p2,4),[0,3,2,1]) to (n-p1-2*p2)/3 by 4 do
%p A026924                 p4 := (n-p1-2*p2-3*p3)/4 ;
%p A026924                 if type(p4,'integer') and p4 >=1 and type(p1+p2+p3+p4,'odd') then
%p A026924                     a := a+1 ;
%p A026924                 end if:
%p A026924             end do:
%p A026924         end do:
%p A026924     end do:
%p A026924     a;
%p A026924 end proc: # _R. J. Mathar_, Aug 22 2019
%Y A026924 4th column of A026920.
%K A026924 nonn
%O A026924 1,8
%A A026924 _Clark Kimberling_