Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Sep 23 2013 14:38:33
%S 2,5,12,27,54,104,192,340,585,982,1610,2590,4097,6378,9792,14848,
%T 22250,32992,48446,70488,101698,145578,206848,291874,409174,570078,
%U 789640,1087744,1490528,2032290,2757826,3725410,5010688,6711480,8953856
%N Number of ways to partition 4*n+3 into distinct positive integers.
%H Harvey P. Dale, <a href="/A078410/b078410.txt">Table of n, a(n) for n = 0..1000</a>
%F a(n) = t(4*n+3, 0), t as defined in A079211.
%t PartitionsQ[4*Range[0,40]+3] (* _Harvey P. Dale_, Sep 23 2013 *)
%Y Bisection of A078408. Cf. A035294, A000009, A078409.
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_, Dec 27 2002
%E More terms from _Reinhard Zumkeller_, Dec 28 2002