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!)
A027357 Number of partitions of n into distinct odd parts, the greatest being congruent to 1 mod 4. 2

%I #14 Oct 29 2019 20:06:04

%S 1,0,0,0,1,1,0,1,2,1,0,1,2,2,1,2,4,3,2,3,5,5,3,5,8,6,5,7,10,10,8,11,

%T 15,14,12,15,20,20,18,22,28,27,25,30,37,38,35,42,51,50,49,56,67,69,67,

%U 77,90,91,90,102,117,121,121,135,155,159,160,177

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

%C Also number of self-conjugate partitions of n into an odd 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) = Sum_{k=0..floor(n/4)-1} A027356(n, 4*k+1). - _Sean A. Irvine_, Oct 28 2019

%Y Cf. A027356, A027358.

%Y Cf. A000700, A053250.

%K nonn

%O 1,9

%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 23 11:35 EDT 2024. Contains 371912 sequences. (Running on oeis4.)