|
|
A352829
|
|
Number of strict integer partitions y of n with a fixed point y(i) = i.
|
|
14
|
|
|
0, 1, 0, 0, 0, 1, 2, 2, 2, 2, 2, 2, 3, 4, 6, 8, 10, 12, 14, 16, 18, 20, 23, 26, 30, 36, 42, 50, 60, 70, 82, 96, 110, 126, 144, 163, 184, 208, 234, 264, 298, 336, 380, 430, 486, 550, 622, 702, 792, 892, 1002, 1125, 1260, 1408, 1572, 1752, 1950, 2168, 2408, 2672
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,7
|
|
LINKS
|
|
|
FORMULA
|
G.f.: Sum_{n>=1} q^(n*(3*n-1)/2)*Product_{k=1..n-1} (1+q^k)/(1-q^k). - Jeremy Lovejoy, Sep 26 2022
|
|
EXAMPLE
|
The a(11) = 2 through a(17) = 12 partitions (A-F = 10..15):
(92) (A2) (B2) (C2) (D2) (E2) (F2)
(821) (543) (643) (653) (753) (763) (863)
(921) (A21) (743) (843) (853) (953)
(5431) (B21) (C21) (943) (A43)
(5432) (6432) (D21) (E21)
(6431) (6531) (6532) (7532)
(7431) (7432) (7631)
(54321) (7531) (8432)
(8431) (8531)
(64321) (9431)
(65321)
(74321)
|
|
MATHEMATICA
|
pq[y_]:=Length[Select[Range[Length[y]], #==y[[#]]&]];
Table[Length[Select[IntegerPartitions[n], UnsameQ@@#&&pq[#]>0&]], {n, 0, 30}]
|
|
CROSSREFS
|
A238352 counts reversed partitions by fixed points, rank statistic A352822.
A238394 counts reversed partitions without a fixed point, ranked by A352830.
A352833 counts partitions by fixed points.
Cf. A008292, A064410, A111133, A114088, A118199, A188674, A257990, A352823, A352824, A352825, A352832.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|