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!)
A284619 Number of partitions of n such that the (sum of distinct even parts) >= n/2. 4
0, 1, 1, 3, 1, 3, 4, 8, 7, 13, 18, 29, 20, 33, 45, 68, 62, 92, 126, 179, 170, 240, 322, 441, 387, 530, 699, 934, 883, 1179, 1537, 2010, 1924, 2514, 3235, 4169, 4094, 5272, 6701, 8521, 7983, 10149, 12784, 16074, 15733, 19770, 24669, 30726, 29682, 36968, 45755 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
The number of partitions of n such that (sum distinct even parts) = n/2 is A284617(n)-A284616(n) = A284619(n)-A284618(n) = 0, 0, 0, 2, 0, 0, 0, 3, 0, 0, 0, 15, 0, 0, 0, 23, 0, 0, 0, 55, 0, 0, 0, 153, 0, 0, 0, 265,... (offset 1, nonzero for 4|n) - R. J. Mathar, Aug 14 2023
LINKS
EXAMPLE
a(4) counts these 3 partitions: 4, 22, 211.
MATHEMATICA
Table[p = IntegerPartitions[n];
Length[Select[Table[Total[Select[DeleteDuplicates[p[[k]]], EvenQ]], {k,
Length[p]}], # >= n/2 &]], {n, 54}]
CROSSREFS
Sequence in context: A008924 A175186 A021323 * A147549 A177355 A349819
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Apr 02 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 March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)