A339006 -id:A339006 - cp's OEIS frontend

A355387 Number of ways to choose a distinct subsequence of an integer composition of n.

1, 2, 5, 14, 37, 98, 259, 682, 1791, 4697, 12303, 32196, 84199, 220087, 575067, 1502176, 3923117, 10244069, 26746171, 69825070, 182276806, 475804961, 1241965456, 3241732629, 8461261457, 22084402087, 57640875725, 150442742575, 392652788250, 1024810764496

Offset: 0

Gus Wiseman, Jul 04 2022

nonn

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.

			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)

Christian Sievers, Table of n, a(n) for n = 0..2000

For partitions we have A000712, composable A339006.
The homogeneous version is A011782, without containment A000302.
With multiplicity we have A025192, for partitions A070933.
The strict case is A032005.
The case of strict subsequences is A236002.
The composable case is A355384, homogeneous without containment A355388.
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.
Cf. A011782, A022811, A032020, A063834, A133494, A181591, A323583, A331330, A336128, A336130, A336139, A355382, A355383.

Table[Sum[Length[Union[Subsets[y]]],{y,Join@@Permutations/@IntegerPartitions[n]}],{n,0,6}]

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

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

a(16) and beyond from Christian Sievers, May 06 2025

A355391 Position of first appearance of n in A181591 = binomial(bigomega(n), omega(n)).

Original entry on oeis.org

1, 4, 8, 16, 32, 24, 128, 256, 512, 48, 2048, 4096, 8192, 16384, 96, 65536, 131072, 262144, 524288, 240, 192, 4194304, 8388608, 16777216, 33554432, 67108864, 134217728, 384, 536870912, 1073741824, 2147483648, 4294967296, 8589934592, 17179869184, 480, 768, 137438953472

Offset: 1

Gus Wiseman, Jul 04 2022

nonn

The statistic omega = A001221 counts distinct prime factors (without multiplicity).
The statistic bigomega = A001222 counts prime factors with multiplicity.
We have A181591(2^k) = k, so the sequence is fully defined. Positions meeting this maximum are A185024, complement A006987.

			The terms together with their prime indices begin:
       1: {}
       4: {1,1}
       8: {1,1,1}
      16: {1,1,1,1}
      32: {1,1,1,1,1}
      24: {1,1,1,2}
     128: {1,1,1,1,1,1,1}
     256: {1,1,1,1,1,1,1,1}
     512: {1,1,1,1,1,1,1,1,1}
      48: {1,1,1,1,2}
    2048: {1,1,1,1,1,1,1,1,1,1,1}
    4096: {1,1,1,1,1,1,1,1,1,1,1,1}
    8192: {1,1,1,1,1,1,1,1,1,1,1,1,1}
   16384: {1,1,1,1,1,1,1,1,1,1,1,1,1,1}
      96: {1,1,1,1,1,2}
   65536: {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}
  131072: {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}
  262144: {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}
  524288: {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}
     240: {1,1,1,1,2,3}
     192: {1,1,1,1,1,1,2}

Amiram Eldar, Table of n, a(n) for n = 1..168

Positions of powers of 2 are A185024, complement A006987.
Counting multiplicity gives A355386.
The sorted version is A355392.
A000005 counts divisors.
A001221 counts prime factors without multiplicity.
A001222 count prime factors with multiplicity.
A070175 gives representatives for bigomega and omega, triangle A303555.
Cf. A022811, A056239 , A071625, A118914, A181819, A323014, A323023, A355383 (with multiplicity A339006), A355384.

s=Table[Binomial[PrimeOmega[n],PrimeNu[n]],{n,1000}];
Table[Position[s,k][[1,1]],{k,Select[Union[s],SubsetQ[s,Range[#]]&]}]

f(n) = binomial(bigomega(n), omega(n)); \\ A181591
a(n) = my(k=1); while (f(k) != n, k++); k; \\ Michel Marcus, Jul 10 2022

binomial(bigomega(a(n)), omega(a(n))) = n.

a(22)-a(28) from Michel Marcus, Jul 10 2022

a(29)-a(37) from Amiram Eldar, Jul 10 2022

A355390 Number of ordered pairs of distinct integer partitions of n.

Original entry on oeis.org

0, 0, 2, 6, 20, 42, 110, 210, 462, 870, 1722, 3080, 5852, 10100, 18090, 30800, 53130, 87912, 147840, 239610, 392502, 626472, 1003002, 1573770, 2479050, 3831806, 5931660, 9057090, 13819806, 20834660, 31399212, 46806122, 69697452, 102870306, 151523790, 221488806

Offset: 0

Gus Wiseman, Jul 04 2022

nonn

			The a(0) = 0 through a(3) = 6 pairs:
  .  .  (11)(2)  (21)(3)
        (2)(11)  (3)(21)
                 (111)(3)
                 (3)(111)
                 (111)(21)
                 (21)(111)

Without distinctness we have A001255, unordered A086737.
The version for compositions is A020522, unordered A006516.
The unordered version is A355389.
A000041 counts partitions, strict A000009.
A001970 counts multiset partitions of partitions.
A063834 counts partitions of each part of a partition.
Cf. A022811, A070933, A316245, A317715, A319910, A323433, A323583, A339006, A355385.

Table[Length[Select[Tuples[IntegerPartitions[n],2],UnsameQ@@#&]],{n,0,15}]

a(n) = 2*binomial(numbpart(n), 2); \\ Michel Marcus, Jul 05 2022

a(n) = 2*A355389(n) = 2*binomial(A000041(n), 2).

cp's OEIS Frontend

A355387 Number of ways to choose a distinct subsequence of an integer composition of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A355391 Position of first appearance of n in A181591 = binomial(bigomega(n), omega(n)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A355390 Number of ordered pairs of distinct integer partitions of n.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

PARI

Formula