|
|
A241380
|
|
Number of partitions of n such that neither the number of parts nor the number of distinct parts is a part.
|
|
5
|
|
|
1, 0, 1, 1, 2, 2, 6, 6, 11, 13, 20, 26, 36, 48, 62, 84, 110, 142, 185, 235, 303, 384, 486, 612, 779, 949, 1205, 1481, 1846, 2248, 2812, 3390, 4181, 5070, 6195, 7450, 9102, 10896, 13199, 15785, 18994, 22660, 27177, 32262, 38482, 45722, 54224, 64125, 75934
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,5
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(6) counts these 6 partitions: 6, 51, 411, 33, 3111, 222.
|
|
MATHEMATICA
|
z = 30; f[n_] := f[n] = IntegerPartitions[n]; d[p_] := [p] = Length[DeleteDuplicates[p]];
Table[Count[f[n], p_ /; MemberQ[p, Length[p]] && MemberQ[p, d[p]]], {n, 0, z}] (* A241377 *)
Table[Count[f[n], p_ /; ! MemberQ[p, Length[p]] && MemberQ[p, d[p]]], {n, 0, z}] (* A241378 *)
Table[Count[f[n], p_ /; MemberQ[p, Length[p]] && ! MemberQ[p, d[p]]], {n, 0, z}] (* A241379 *)
Table[Count[f[n], p_ /; ! MemberQ[p, Length[p]] && ! MemberQ[p, d[p]]], {n, 0, z}] (* A241380 *)
Table[Count[f[n], p_ /; MemberQ[p, Length[p]] || MemberQ[p, d[p]]], {n, 0, z}] (* A241381 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|