The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A240497 Number of partitions p of n such that the multiplicity of (min(p) + max(p))/2  is a part. 5
 1, 0, 0, 1, 0, 1, 1, 2, 5, 5, 7, 10, 12, 17, 23, 30, 35, 49, 61, 78, 97, 124, 155, 200, 243, 307, 375, 470, 568, 710, 857, 1051, 1269, 1554, 1862, 2265, 2700, 3273, 3895, 4685, 5558, 6658, 7883, 9394, 11084, 13167, 15493, 18336, 21517, 25367, 29703, 34914 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,8 LINKS EXAMPLE a(9) counts these 5 partitions:  531, 333, 3321, 32211, 321111. MATHEMATICA z = 60; f[n_] := f[n] = IntegerPartitions[n]; Table[Count[f[n], p_ /; MemberQ[p, Count[p, 2*Min[p]]]], {n, 0, z}]  (* A240496 *) Table[Count[f[n], p_ /; MemberQ[p, Count[p, (Min[p] + Max[p])/2]]], {n, 1, z}]  (* A240497 *) Table[Count[f[n], p_ /; MemberQ[p, Count[p, Min[p]*Max[p]]]], {n, 0,  z}]  (* A240498 *) Table[Count[f[n], p_ /; MemberQ[p, Count[p, Length[p]]]], {n, 0, z}]  (* A240499 *) Table[Count[f[n], p_ /; MemberQ[p, Count[p, 2*Length[p]]]], {n, 0, z}]  (* A240500 *) CROSSREFS Cf. A240496, A240498, A240499, A240500. Sequence in context: A342852 A023850 A175649 * A142353 A161180 A101858 Adjacent sequences:  A240494 A240495 A240496 * A240498 A240499 A240500 KEYWORD nonn,easy AUTHOR Clark Kimberling, Apr 06 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 26 12:17 EST 2022. Contains 350598 sequences. (Running on oeis4.)