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!)
A284614 Number of partitions of n such that the (sum of distinct odd parts) > n/2. 3
1, 0, 1, 1, 3, 3, 6, 4, 8, 10, 16, 16, 26, 36, 50, 55, 82, 85, 115, 136, 190, 216, 284, 340, 467, 500, 651, 801, 1066, 1181, 1516, 1665, 2187, 2393, 3050, 3466, 4482, 5028, 6340, 6951, 8895, 9953, 12458, 13640, 17241, 19649, 24385, 26386, 33078, 36138, 44569 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
EXAMPLE
a(5) counts these 3 partitions: 5, 32, 311.
MATHEMATICA
Table[p = IntegerPartitions[n];
Length[Select[Table[Total[Select[DeleteDuplicates[p[[k]]], OddQ]], {k, Length[p]}], # > n/2 &]], {n, 55}]
CROSSREFS
Sequence in context: A182627 A135986 A334848 * A349392 A069734 A265703
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 April 23 08:33 EDT 2024. Contains 371905 sequences. (Running on oeis4.)