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!)
A238495 Number of partitions p of n such that min(p) + (number of parts of p) is not a part of p. 0
1, 2, 3, 4, 7, 9, 14, 19, 27, 36, 51, 66, 90, 118, 156, 201, 264, 336, 434, 550, 700, 880, 1112, 1385, 1733, 2149, 2666, 3283, 4049, 4956, 6072, 7398, 9009, 10922, 13237, 15970, 19261, 23147, 27790, 33260, 39776, 47425, 56497, 67133, 79685, 94371, 111653 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

FORMULA

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

EXAMPLE

a(6) = 9 counts all the 11 partitions of 6 except 42 and 411.

MATHEMATICA

Table[Count[IntegerPartitions[n], p_ /; ! MemberQ[p, Length[p] + Min[p]]], {n, 50}]

CROSSREFS

Cf. A096373.

Sequence in context: A108950 A238545 A325343 * A239329 A094093 A240077

Adjacent sequences:  A238492 A238493 A238494 * A238496 A238497 A238498

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 28 22:08 EDT 2022. Contains 354122 sequences. (Running on oeis4.)