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!)
A284611 Number of partitions of n such that the (sum of all even parts) = floor(n/2). 1
1, 0, 0, 1, 2, 0, 0, 4, 6, 0, 0, 12, 15, 0, 0, 30, 40, 0, 0, 70, 84, 0, 0, 165, 198, 0, 0, 330, 405, 0, 0, 704, 836, 0, 0, 1380, 1620, 0, 0, 2688, 3192, 0, 0, 4984, 5824, 0, 0, 9394, 10934, 0, 0, 16665, 19392, 0, 0, 29970, 34560, 0, 0, 52096 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
EXAMPLE
a(8) counts these 3 partitions: 44, 431, 4111.
MATHEMATICA
Table[p = IntegerPartitions[n];
Length[Select[Table[Total[Select[p[[k]], EvenQ]], {k, Length[p]}], # ==
Floor[n/2] &]], {n, 60}]
CROSSREFS
Sequence in context: A351403 A213370 A244138 * A282551 A333706 A056676
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Mar 30 2017
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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)