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!)
A284615 Number of partitions of n such that the (sum of distinct odd parts) >= n/2. 3
1, 1, 1, 1, 3, 4, 6, 9, 8, 11, 16, 24, 26, 37, 50, 75, 82, 113, 115, 166, 190, 259, 284, 400, 467, 619, 651, 887, 1066, 1394, 1516, 2020, 2187, 2809, 3050, 3983, 4482, 5691, 6340, 8149, 8895, 11158, 12458, 15796, 17241, 21452, 24385, 30582, 33078, 40775 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

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

FORMULA

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

Cf. A284612, A284613, A284614.

Sequence in context: A084438 A186700 A028987 * A186709 A143037 A225059

Adjacent sequences:  A284612 A284613 A284614 * A284616 A284617 A284618

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 9 10:48 EDT 2021. Contains 343732 sequences. (Running on oeis4.)