This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A238481 Number of partitions p of n that do not include (min(p) + max(p))/2 as a part. 3
 0, 0, 1, 2, 5, 6, 12, 16, 22, 33, 46, 57, 83, 110, 138, 188, 244, 308, 403, 513, 642, 826, 1035, 1285, 1615, 2014, 2475, 3077, 3782, 4626, 5678, 6934, 8410, 10242, 12386, 14951, 18042, 21711, 26011, 31198, 37283, 44465, 52978, 62999, 74699, 88580, 104753 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS FORMULA A238480(n) + A238481(n) = A000041(n). EXAMPLE a(6) counts these partitions:   51 (as part (5+1)/2 = 3 is not included),   42 (as (4+2)/2 = 3 is not included),   411 (as (4+1)/2 = 2.5 cannot be included),   3111 (as (3+1)/2 = 2 is not included),   2211 (as (2+1)/2 = 1.5 cannot be included),   21111 (ditto). Thus a(6) = 6. MATHEMATICA Table[Count[IntegerPartitions[n], p_ /; !MemberQ[p, (Min[p] + Max[p])/2]], {n, 40}] CROSSREFS Cf. A238480. Sequence in context: A309043 A023143 A085206 * A058601 A108365 A064765 Adjacent sequences:  A238478 A238479 A238480 * A238482 A238483 A238484 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 10 12:42 EST 2019. Contains 329895 sequences. (Running on oeis4.)