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
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, 12, 17, 18, 15, 17, 23, 24, 21, 25, 32, 33, 31, 34, 43, 45, 42, 48, 58, 61, 58, 64, 77, 80, 78, 87, 102, 107, 106, 115, 134, 141, 139, 153, 175 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,11
COMMENTS
Also number of self-conjugate partitions of n into an even number of parts. - Vladeta Jovovic, Feb 18 2004
LINKS
FORMULA
a(n) = (A000700(n)+(-1)^n*A053250(n))/2. - Vladeta Jovovic, Mar 12 2006
a(n) + A027357(n) = A000700(n). - R. J. Mathar, Oct 03 2016
a(n) = Sum_{k=0..floor(n/4)-1} A027356(n, 4*k+3). - Sean A. Irvine, Oct 28 2019
CROSSREFS
Sequence in context: A278566 A255559 A181935 * A332548 A352685 A191781
KEYWORD
nonn
AUTHOR
STATUS
approved

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 March 29 00:26 EDT 2024. Contains 371264 sequences. (Running on oeis4.)