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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A239946 Number of partitions of n not containing the number of distinct parts as a part. 2
1, 0, 1, 1, 3, 3, 6, 8, 12, 16, 23, 32, 42, 58, 74, 102, 131, 170, 220, 283, 359, 462, 579, 727, 922, 1136, 1424, 1763, 2183, 2667, 3308, 4019, 4917, 5982, 7285, 8774, 10666, 12797, 15437, 18505, 22181, 26481, 31678, 37649, 44773, 53177, 62994, 74466, 88014 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,5

LINKS

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

FORMULA

a(n) + A239945(n) = A000041(n) for n >= 0.

EXAMPLE

a(7) counts these 8 partitions:  7, 61, 511, 43, 421, 4111, 331, 31111.

MATHEMATICA

z = 55; d[p_] := d[p] = Length[DeleteDuplicates[p]]; Table[Count[IntegerPartitions[n], p_ /; MemberQ[p, d[p]]], {n, 0, z}]  (* A239945 *)

Table[PartitionsP[n] - t[[n + 1]], {n, 0, z}] (* A239946 *)

CROSSREFS

Cf. A239945.

Sequence in context: A168637 A241390 A241831 * A130780 A174524 A143592

Adjacent sequences:  A239943 A239944 A239945 * A239947 A239948 A239949

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Mar 30 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 7 12:19 EDT 2020. Contains 336276 sequences. (Running on oeis4.)