login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A027358 Number of partitions of n into distinct odd parts, the greatest being congruent to 3 mod 4. 2

%I #16 Oct 29 2019 20:06:13

%S 0,0,1,1,0,0,1,1,0,1,2,2,1,1,3,3,1,2,4,4,3,3,6,6,4,6,9,9,7,8,12,12,10,

%T 12,17,18,15,17,23,24,21,25,32,33,31,34,43,45,42,48,58,61,58,64,77,80,

%U 78,87,102,107,106,115,134,141,139,153,175

%N Number of partitions of n into distinct odd parts, the greatest being congruent to 3 mod 4.

%C Also number of self-conjugate partitions of n into an even number of parts. - _Vladeta Jovovic_, Feb 18 2004

%F a(n) = (A000700(n)+(-1)^n*A053250(n))/2. - _Vladeta Jovovic_, Mar 12 2006

%F a(n) + A027357(n) = A000700(n). - _R. J. Mathar_, Oct 03 2016

%F a(n) = Sum_{k=0..floor(n/4)-1} A027356(n, 4*k+3). - _Sean A. Irvine_, Oct 28 2019

%Y Cf. A027356, A027357.

%Y Cf. A000700, A053250.

%K nonn

%O 1,11

%A _Clark Kimberling_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 27 12:04 EDT 2024. Contains 372019 sequences. (Running on oeis4.)