OFFSET
0,2
COMMENTS
By "distinct" we mean equal subsequences are counted only once. For example, the pair (1,1)(1) is counted only once even though (1) is a subsequence of (1,1) in two ways. The version with multiplicity is A025192.
LINKS
Christian Sievers, Table of n, a(n) for n = 0..2000
FORMULA
G.f.: (1-x)/((1-2*x)*(1-f)) where f = Sum_{k>=1} x^k/(1-x/(1-x)+x^k) is the generating function for A331330. - Christian Sievers, May 06 2025
EXAMPLE
The a(3) = 14 pairings of a composition with a chosen subsequence:
(3)() (3)(3)
(21)() (21)(1) (21)(2) (21)(21)
(12)() (12)(1) (12)(2) (12)(12)
(111)() (111)(1) (111)(11) (111)(111)
MATHEMATICA
Table[Sum[Length[Union[Subsets[y]]], {y, Join@@Permutations/@IntegerPartitions[n]}], {n, 0, 6}]
PROG
(PARI) lista(n)=my(f=sum(k=1, n, (x^k+x*O(x^n))/(1-x/(1-x)+x^k))); Vec((1-x)/((1-2*x)*(1-f))) \\ Christian Sievers, May 06 2025
CROSSREFS
The strict case is A032005.
The case of strict subsequences is A236002.
A075900 counts compositions of each part of a partition.
A304961 counts compositions of each part of a strict partition.
A307068 counts strict compositions of each part of a composition.
A336127 counts compositions of each part of a strict composition.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jul 04 2022
EXTENSIONS
a(16) and beyond from Christian Sievers, May 06 2025
STATUS
approved
