The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A307683 Number of partitions of n having median (2m-1)/2 for some integer m. 2
 0, 0, 1, 0, 2, 1, 4, 1, 7, 5, 11, 8, 18, 17, 31, 28, 47, 51, 75, 81, 119, 134, 181, 206, 277, 323, 420, 488, 623, 737, 922, 1084, 1352, 1597, 1960, 2313, 2819, 3330, 4029, 4743, 5704, 6722, 8030, 9434, 11234, 13175, 15601, 18262, 21552, 25184, 29612, 34518 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS FORMULA a(7) counts these 4 partitions: [6,1], [5,2], [4,3], [3,2,1,1]. MATHEMATICA Table[Count[IntegerPartitions[n], q_ /; ! IntegerQ[Median[q]] && IntegerQ[2*Median[q]]], {n, z}] CROSSREFS Cf. A000041, A325348. Sequence in context: A115122 A097360 A325348 * A248058 A072345 A200583 Adjacent sequences:  A307680 A307681 A307682 * A307684 A307685 A307686 KEYWORD nonn,easy AUTHOR Clark Kimberling, Apr 24 2019 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 June 4 11:32 EDT 2020. Contains 334825 sequences. (Running on oeis4.)