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!)
A238487 Number of partitions p of n not containing round((min(p) + max(p))/2) as a part. 1
0, 0, 0, 1, 2, 4, 6, 11, 14, 24, 30, 44, 57, 84, 102, 145, 180, 241, 302, 403, 494, 648, 796, 1015, 1253, 1593, 1941, 2439, 2969, 3680, 4477, 5523, 6672, 8176, 9847, 11968, 14385, 17406, 20816, 25066, 29896, 35802, 42587, 50819, 60214, 71585, 84594, 100151 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
COMMENTS
As used here, if k is a positive integer, then round(k + 1/2) = k + 1.
LINKS
FORMULA
a(n) + A238486(n) = A000041(n).
EXAMPLE
a(6) counts these partitions: 51, 42, 411, 3111.
MATHEMATICA
Table[Count[IntegerPartitions[n], p_ /; !MemberQ[p, Round[(Min[p] + Max[p])/2]]], {n, 30}]
CROSSREFS
Cf. A238486.
Sequence in context: A274261 A156913 A238483 * A138461 A173397 A187492
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Feb 27 2014
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 19:39 EDT 2024. Contains 371963 sequences. (Running on oeis4.)