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
John Tyler Rascoe, Table of n, a(n) for n = 0..10000
FORMULA
G.f.: x^3 * (3-x-x^2-x^3)/((1-x)*(1-x^2)*(1-x^3)). - John Tyler Rascoe, Jul 01 2024
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))))}
A_x(50) \\ John Tyler Rascoe, Jul 01 2024
CROSSREFS
For partitions we appear to have A137719.
A003242 counts compressed compositions (anti-runs).
A011782 counts compositions.
A114901 counts compositions with no isolated parts.
A240085 counts compositions with no unique parts.
A333755 counts compositions by compressed length.
A373948 represents the run-compression transformation.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jun 29 2024
EXTENSIONS
a(26) onwards from John Tyler Rascoe, Jul 01 2024
STATUS
approved