|
|
A373952
|
|
Number of integer compositions of n whose run-compression sums to 3.
|
|
7
|
|
|
0, 0, 0, 3, 2, 4, 5, 6, 6, 9, 8, 10, 11, 12, 12, 15, 14, 16, 17, 18, 18, 21, 20, 22, 23, 24, 24, 27, 26, 28, 29, 30, 30, 33, 32, 34, 35, 36, 36, 39, 38, 40, 41, 42, 42, 45, 44, 46, 47, 48, 48, 51, 50, 52, 53, 54, 54, 57, 56, 58, 59, 60, 60, 63, 62, 64, 65, 66
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
We define the (run-) compression of a sequence to be the anti-run obtained by reducing each run of repeated parts to a single part. Alternatively, compression removes all parts equal to the part immediately to their left. For example, (1,1,2,2,1) has compression (1,2,1).
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The a(3) = 3 through a(9) = 9 compositions:
(3) (112) (122) (33) (1222) (11222) (333)
(12) (211) (221) (1122) (2221) (22211) (12222)
(21) (1112) (2211) (11122) (111122) (22221)
(2111) (11112) (22111) (221111) (111222)
(21111) (111112) (1111112) (222111)
(211111) (2111111) (1111122)
(2211111)
(11111112)
(21111111)
|
|
MATHEMATICA
|
Table[Length[Select[Join@@Permutations /@ IntegerPartitions[n], Total[First/@Split[#]]==3&]], {n, 0, 10}]
|
|
PROG
|
(PARI)
A_x(N)={my(x='x+O('x^N)); concat([0, 0, 0], Vec(x^3 *(3-x-x^2-x^3)/((1-x)*(1-x^2)*(1-x^3))))}
|
|
CROSSREFS
|
For partitions we appear to have A137719.
The compression-sum statistic is represented by A373953, difference A373954.
A003242 counts compressed compositions (anti-runs).
A114901 counts compositions with no isolated parts.
A116861 counts partitions by compressed sum, by compressed length A116608.
A240085 counts compositions with no unique parts.
A333755 counts compositions by compressed length.
A373948 represents the run-compression transformation.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|