login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A325345 Number of partitions of n with odd minimal part and even maximal part. 4
0, 0, 0, 0, 1, 0, 2, 1, 4, 2, 7, 4, 12, 9, 18, 15, 30, 26, 46, 43, 70, 70, 106, 108, 159, 169, 235, 253, 346, 379, 502, 558, 725, 815, 1037, 1171, 1475, 1678, 2080, 2372, 2917, 3338, 4062, 4657, 5624, 6459, 7743, 8892, 10603, 12186 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,7

COMMENTS

The four sequences A325338, A325344, A325345, A325346 partition the partition numbers, A000041.

LINKS

Table of n, a(n) for n=1..50.

EXAMPLE

a(7) counts these 2 partitions:  [5,2], [3,2,2]

MATHEMATICA

Table[Count[IntegerPartitions[n], q_ /; OddQ[Max[q]] && EvenQ[Min[q]]], {n, 30}]

CROSSREFS

Cf. A000041, A325338, A325344, A325346.

Sequence in context: A008796 A254594 A280948 * A079966 A101707 A304587

Adjacent sequences:  A325342 A325343 A325344 * A325346 A325347 A325348

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Apr 23 2019

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 14 01:03 EST 2019. Contains 329977 sequences. (Running on oeis4.)