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!)
A238486 Number of partitions p of n containing round((min(p) + max(p))/2) as a part. 1
1, 2, 3, 4, 5, 7, 9, 11, 16, 18, 26, 33, 44, 51, 74, 86, 117, 144, 188, 224, 298, 354, 459, 560, 705, 843, 1069, 1279, 1596, 1924, 2365, 2826, 3471, 4134, 5036, 6009, 7252, 8609, 10369, 12272, 14687, 17372, 20674, 24356, 28920, 33973, 40160, 47122, 55471 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
As used here, if k is a positive integer, then round(k + 1/2) = k + 1.
LINKS
FORMULA
a(n) + A238487(n) = A000041(n).
EXAMPLE
a(6) counts these partitions: 6, 33, 321, 222, 2211, 21111, 111111.
MATHEMATICA
Table[Count[IntegerPartitions[n], p_ /; MemberQ[p, Round[(Min[p] + Max[p])/2]]], {n, 30}]
CROSSREFS
Cf. A238487.
Sequence in context: A291927 A239497 A039850 * A238482 A368483 A033100
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 May 7 19:42 EDT 2024. Contains 372313 sequences. (Running on oeis4.)