A240871 Number of partitions p of n into distinct parts such that max(p) = 3 + min(p).

0, 0, 0, 0, 0, 1, 0, 2, 1, 1, 2, 2, 0, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 0, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 0, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 0, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 0, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 0, 2, 2, 1, 1, 2, 1, 2, 1

Offset

0,8

Links

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

Example

a(7) counts these 2 partitions:  52, 421.

Mathematica

z = 40; f[n_] := f[n] = Select[IntegerPartitions[n], Max[Length /@ Split@#] == 1 &]; Table[Count[f[n], p_ /; Max[p] == 2 + Min[p]], {n, 0, z}] (* A171182 *)
    Table[Count[f[n], p_ /; Max[p] == 3 + Min[p]], {n, 0, z}] (* A240871 *)
    Table[Count[f[n], p_ /; Max[p] == 4 + Min[p]], {n, 0, z}] (* A240872 *)
    Table[Count[f[n], p_ /; Max[p] == 5 + Min[p]], {n, 0, z}] (* A240873 *)

Crossrefs

Cf. A171182, A240872, A240873.

Sequence in context: A357458 A349277 A307014 * A236765 A171531 A171532

Adjacent sequences: A240868 A240869 A240870 * A240872 A240873 A240874

Keyword

nonn,easy

Author

Clark Kimberling, Apr 15 2014

Status

approved