login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A238485 Number of partitions p of n not containing ceiling((min(p) + max(p))/2) as a part. 1
0, 0, 0, 1, 2, 4, 7, 11, 15, 25, 32, 45, 63, 84, 108, 150, 188, 247, 321, 407, 514, 666, 824, 1039, 1304, 1620, 2003, 2497, 3054, 3761, 4617, 5631, 6848, 8356, 10090, 12217, 14751, 17744, 21300, 25579, 30553, 36506, 43523, 51768, 61458, 72943, 86273, 101992 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

Table of n, a(n) for n=1..48.

FORMULA

a(n) + A238484(n) = A000041(n).

EXAMPLE

a(6) counts these partitions:  51, 42, 411, 3111.

MATHEMATICA

Table[Count[IntegerPartitions[n], p_ /; !MemberQ[p, Ceiling[(Min[p] + Max[p])/2]]], {n, 30}]

CROSSREFS

Cf. A238482.

Sequence in context: A261878 A261993 A299251 * A316264 A067744 A307601

Adjacent sequences:  A238482 A238483 A238484 * A238486 A238487 A238488

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 19 20:20 EDT 2019. Contains 326133 sequences. (Running on oeis4.)