login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A284610 Number of partitions of n such that the (sum of distinct even parts) = floor(n/2). 2
1, 0, 0, 2, 3, 0, 0, 3, 4, 0, 0, 15, 20, 0, 0, 23, 31, 0, 0, 55, 70, 0, 0, 153, 195, 0, 0, 265, 335, 0, 0, 535, 664, 0, 0, 988, 1208, 0, 0, 2242, 2750, 0, 0, 3580, 4332, 0, 0, 6941, 8349, 0, 0, 11621, 13909, 0, 0, 20681, 24585, 0, 0, 37202 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

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

EXAMPLE

a(5) counts these 3 partitions: 32, 221, 2111.

MATHEMATICA

Table[p = IntegerPartitions[n];

  Length[Select[Table[Total[Select[DeleteDuplicates[p[[k]]], EvenQ]], {k, Length[p]}], # == Floor[n/2] &]], {n, 60}](* Peter J. C. Moses, Mar 29 2017 *)

CROSSREFS

Cf. A284608, A284616, A284617.

Sequence in context: A170843 A292596 A011023 * A234017 A182057 A260928

Adjacent sequences:  A284607 A284608 A284609 * A284611 A284612 A284613

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 22 21:29 EDT 2021. Contains 345393 sequences. (Running on oeis4.)