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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A239958 Number of partitions p of n such that (number of distinct parts of p) >= max(p) - min(p). 4
1, 1, 2, 3, 5, 6, 9, 11, 16, 18, 25, 30, 39, 47, 59, 69, 89, 105, 126, 153, 184, 215, 259, 307, 362, 426, 501, 583, 687, 800, 923, 1080, 1252, 1439, 1666, 1917, 2202, 2533, 2900, 3311, 3792, 4326, 4915, 5605, 6366, 7205, 8180, 9259, 10458, 11815, 13322 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

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

FORMULA

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

EXAMPLE

a(6) counts all of the 15 partitions of 7 except these 4:  61, 52, 511, 1111111.

MATHEMATICA

z = 60; d[p_] := d[p] = Length[DeleteDuplicates[p]]; f[p_] := f[p] = Max[p] - Min[p]; g[n_] := g[n] = IntegerPartitions[n];

Table[Count[g[n], p_ /; d[p] < f[p]], {n, 0, z}]  (*A239954*)

Table[Count[g[n], p_ /; d[p] <= f[p]], {n, 0, z}] (*A239955*)

Table[Count[g[n], p_ /; d[p] == f[p]], {n, 0, z}] (*A239956*)

Table[Count[g[n], p_ /; d[p] > f[p]], {n, 0, z}]  (*A034296*)

Table[Count[g[n], p_ /; d[p] >= f[p]], {n, 0, z}] (*A239958*)

CROSSREFS

Cf. A239954, A239955, A239956, A034296.

Sequence in context: A008770 A230515 A030068 * A008769 A115270 A027588

Adjacent sequences:  A239955 A239956 A239957 * A239959 A239960 A239961

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 March 20 15:43 EDT 2019. Contains 321345 sequences. (Running on oeis4.)