A318991 -id:A318991 - cp's OEIS frontend

A342523 Heinz numbers of integer partitions with weakly increasing first quotients.

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 51, 52, 53, 55, 56, 57, 58, 59, 61, 62, 63, 64, 65, 66, 67, 68, 69, 71, 73, 74, 76

Offset: 1

Gus Wiseman, Mar 23 2021

nonn

Also called log-concave-up partitions.
The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.
The first quotients of a sequence are defined as if the sequence were an increasing divisor chain, so for example the first quotients of (6,3,1) are (1/2,1/3).

			The prime indices of 60 are {1,1,2,3}, with first quotients (1,2,3/2), so 60 is not in the sequence.
Most small numbers are in the sequence, but the sequence of non-terms together with their prime indices begins:
   18: {1,2,2}
   30: {1,2,3}
   36: {1,1,2,2}
   50: {1,3,3}
   54: {1,2,2,2}
   60: {1,1,2,3}
   70: {1,3,4}
   72: {1,1,1,2,2}
   75: {2,3,3}
   90: {1,2,2,3}
   98: {1,4,4}
  100: {1,1,3,3}

Robert Price, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Logarithmically Concave Sequence.
Gus Wiseman, Sequences counting and ranking integer partitions by the differences of their successive parts.
Gus Wiseman, Sequences counting and ranking partitions and compositions by their differences and quotients.

The version counting strict divisor chains is A057567.
For multiplicities (prime signature) instead of quotients we have A304678.
For differences instead of quotients we have A325360 (count: A240026).
These partitions are counted by A342523 (strict: A342516, ordered: A342492).
The strictly increasing version is A342524.
The weakly decreasing version is A342526.
A000041 counts partitions (strict: A000009).
A000929 counts partitions with adjacent parts x >= 2y.
A001055 counts factorizations (strict: A045778, ordered: A074206).
A003238 counts chains of divisors summing to n - 1 (strict: A122651).
A167865 counts strict chains of divisors > 1 summing to n.
A318991/A318992 rank reversed partitions with/without integer quotients.
A342086 counts strict chains of divisors with strictly increasing quotients.
Cf. A000005, A002843, A056239, A067824, A112798, A124010, A130091, A238710, A253249, A325351, A325352, A342191.

primeptn[n_]:=If[n==1,{},Reverse[Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]];
Select[Range[100],LessEqual@@Divide@@@Reverse/@Partition[primeptn[#],2,1]&]

A342530 Number of strict chains of divisors ending with n and having distinct first quotients.

Original entry on oeis.org

1, 2, 2, 3, 2, 6, 2, 6, 3, 6, 2, 12, 2, 6, 6, 9, 2, 12, 2, 12, 6, 6, 2, 28, 3, 6, 6, 12, 2, 26, 2, 14, 6, 6, 6, 31, 2, 6, 6, 28, 2, 26, 2, 12, 12, 6, 2, 52, 3, 12, 6, 12, 2, 28, 6, 28, 6, 6, 2, 66, 2, 6, 12, 25, 6, 26, 2, 12, 6, 26, 2, 76, 2, 6, 12, 12, 6, 26

Offset: 1

Gus Wiseman, Mar 25 2021

nonn

The first quotients of a sequence are defined as if the sequence were an increasing divisor chain, so for example the quotients of (6,3,1) are (1/2,1/3).

			The a(1) = 1 through a(12) = 12 chains (reversed):
  1  2    3    4    5    6      7    8      9    10      11    12
     2/1  3/1  4/1  5/1  6/1    7/1  8/1    9/1  10/1    11/1  12/1
               4/2       6/2         8/2    9/3  10/2          12/2
                         6/3         8/4         10/5          12/3
                         6/2/1       8/2/1       10/2/1        12/4
                         6/3/1       8/4/1       10/5/1        12/6
                                                               12/2/1
                                                               12/3/1
                                                               12/4/1
                                                               12/4/2
                                                               12/6/1
                                                               12/6/2
Not counted under a(12) are: 12/4/2/1, 12/6/2/1, 12/6/3, 12/6/3/1.

Gus Wiseman, Sequences counting and ranking partitions and compositions by their differences and quotients.

The version for weakly increasing first quotients is A057567.
The version for equal first quotients is A169594.
The case of chains starting with 1 is A254578.
The version for strictly increasing first quotients is A342086.
A001055 counts factorizations (strict: A045778, ordered: A074206).
A067824 counts strict chains of divisors ending with n.
A167865 counts strict chains of divisors > 1 summing to n.
A253249 counts strict chains of divisors.
A334997 counts chains of divisors of n by length.
A342495/A342529 count compositions with equal/distinct quotients.
A342496/A342514 count partitions with equal/distinct quotients.
A342515/A342520 count strict partitions with equal/distinct quotients.
A342522/A342521 rank partitions with equal/distinct quotients.
Cf. A000009, A003238, A003242, A122651, A179254, A318991, A318992, A325545.

cmi[n_]:=Prepend[Prepend[#,n]&/@Join@@cmi/@Most[Divisors[n]],{n}];
Table[Length[Select[cmi[n],UnsameQ@@Divide@@@Partition[#,2,1]&]],{n,100}]

a(n) = Sum_{d|n} A254578(d). - Ridouane Oudra, Jun 17 2025

A358103 Quotient of the n-th divisible pair, where pairs are ordered by Heinz number. Quotient of prime indices of A318990(n).

Original entry on oeis.org

1, 2, 1, 3, 4, 2, 5, 1, 6, 7, 8, 3, 9, 1, 4, 10, 11, 2, 12, 13, 14, 5, 15, 16, 6, 3, 17, 1, 18, 7, 2, 19, 20, 21, 22, 8, 23, 1, 24, 9, 4, 25, 26, 27, 10, 28, 29, 30, 5, 11, 31, 3, 32, 12, 33, 34, 1, 35, 36, 13, 6, 37, 2, 14, 38, 39, 15, 40, 41, 1, 42, 7, 4, 43

Offset: 1

Gus Wiseman, Nov 02 2022

nonn

The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.

			The 12th divisible pair is (2,6) so a(12) = 3.

The divisible pairs are ranked by A318990, proper A339005.
Quotient of A358104 and A358105.
A different ordering is A358106.
A000040 lists the primes.
A001222 counts prime indices, distinct A001221.
A001358 lists the semiprimes, squarefree A006881.
A003963 multiplies together prime indices.
A056239 adds up prime indices.
A358192/A358193 gives quotients of semiprime indices.
Cf. A000720, A027751, A032741, A215366, A289508, A289509, A296150, A300912, A318991, A318992.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Join@@Table[Cases[primeMS[n],{x_,y_}/;Divisible[y,x]:>y/x,{0}],{n,100}]

a(n) = A358104(n)/A358105(n).

A358104 Unreduced numerator of the n-th divisible pair, where pairs are ordered by Heinz number. Greater prime index of A318990(n).

Original entry on oeis.org

1, 2, 2, 3, 4, 4, 5, 3, 6, 7, 8, 6, 9, 4, 8, 10, 11, 6, 12, 13, 14, 10, 15, 16, 12, 9, 17, 5, 18, 14, 8, 19, 20, 21, 22, 16, 23, 6, 24, 18, 12, 25, 26, 27, 20, 28, 29, 30, 15, 22, 31, 12, 32, 24, 33, 34, 7, 35, 36, 26, 18, 37, 10, 28, 38, 39, 30, 40, 41, 8, 42

Offset: 1

Gus Wiseman, Nov 02 2022

nonn

The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.

			The 12th divisible pair is (2,6) so a(12) = 6.

The divisible pairs are ranked by A318990, proper A339005.
For all semiprimes we have A338913.
The quotient of the pair is A358103.
The denominator is A358105.
The reduced version for all semiprimes is A358192, denominator A358193.
A000040 lists the primes.
A001222 counts prime indices, distinct A001221.
A001358 lists the semiprimes, squarefree A006881.
A003963 multiplies together prime indices.
A056239 adds up prime indices.
A318991 ranks divisor-chains.
Cf. A000720, A032741, A128301, A215366, A289508, A289509, A296150, A300912, A318992, A358106.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Join@@Table[Cases[primeMS[n],{x_,y_}/;Divisible[y,x]:>y,{0}],{n,1000}]

A358103(n) = a(n)/A358105(n).

A358105 Unreduced denominator of the n-th divisible pair, where pairs are ordered by Heinz number. Lesser prime index of A318990(n).

Original entry on oeis.org

1, 1, 2, 1, 1, 2, 1, 3, 1, 1, 1, 2, 1, 4, 2, 1, 1, 3, 1, 1, 1, 2, 1, 1, 2, 3, 1, 5, 1, 2, 4, 1, 1, 1, 1, 2, 1, 6, 1, 2, 3, 1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 4, 1, 2, 1, 1, 7, 1, 1, 2, 3, 1, 5, 2, 1, 1, 2, 1, 1, 8, 1, 3, 4, 1, 1, 2, 1, 1, 2, 1, 3, 1, 2, 1, 1, 1, 1

Offset: 1

Gus Wiseman, Nov 02 2022

nonn

The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.

			The 12th divisible pair is (2,6) so a(12) = 2.

The divisible pairs are ranked by A318990, proper A339005.
For all semiprimes we have A338912, greater A338913.
The quotient of the pair is A358103.
The reduced version for all semiprimes is A358193, numerator A358192.
A000040 lists the primes.
A001222 counts prime indices, distinct A001221.
A001358 lists the semiprimes, squarefree A006881.
A003963 multiplies together prime indices.
A056239 adds up prime indices.
A318991 ranks divisor-chains.
Cf. A000720, A027751, A128301, A215366, A289508, A289509, A296150, A300912, A318992, A358106.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Join@@Table[Cases[primeMS[n],{x_,y_}/;Divisible[y,x]:>x,{0}],{n,1000}]

A358103(n) = A358104(n)/a(n).

A358106 Quotient of the n-th divisible pair, where pairs are ordered first by sum and then by denominator.

Original entry on oeis.org

1, 2, 3, 1, 4, 5, 2, 1, 6, 7, 3, 1, 8, 2, 9, 4, 1, 10, 11, 5, 3, 2, 1, 12, 13, 6, 1, 14, 4, 2, 15, 7, 3, 1, 16, 17, 8, 5, 2, 1, 18, 19, 9, 4, 3, 1, 20, 6, 2, 21, 10, 1, 22, 23, 11, 7, 5, 3, 2, 1, 24, 4, 25, 12, 1, 26, 8, 2, 27, 13, 6, 3, 1, 28, 29, 14, 9, 5, 4, 2, 1

Offset: 2

Gus Wiseman, Nov 03 2022

			Grouping by sum gives:
   2:  1
   3:  2
   4:  3 1
   5:  4
   6:  5 2 1
   7:  6
   8:  7 3 1
   9:  8 2
  10:  9 4 1
  11: 10
  12: 11 5 3 2 1
  13: 12
  14: 13 6 1
  15: 14 4 2
  16: 15 7 3 1
  17: 16
  18: 17 8 5 2 1

Row-lengths are A032741.
This is A208460/A027751.
A ranking of divisible pairs is A318990, proper A339005.
A different ordering is A358103 = A358104 / A358105.
A000041 counts partitions, strict A000009.
A001358 lists semiprimes, squarefree A006881.
A318991 ranks divisor-chains.
A358192/A358193 gives quotients of semiprime indices.
Cf. A000837, A003238, A122934.

Table[Divide@@@Select[IntegerPartitions[n,{2}],Divisible@@#&],{n,2,30}]

a(n) = A208460(n)/A027751(n).

A358192 Numerator of the quotient of the prime indices of the n-th semiprime.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 3, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 2, 1, 4, 1, 3, 1, 1, 2, 2, 1, 3, 1, 1, 1, 1, 4, 1, 1, 2, 1, 1, 1, 2, 1, 5, 3, 1, 3, 1, 1, 4, 1, 1, 2, 1, 1, 1, 5, 1, 2, 1, 2, 3, 1, 5, 1, 1, 3, 4, 1, 2, 6, 1, 1, 1, 3, 2, 5, 1, 1, 1, 3, 1, 1

Offset: 1

Gus Wiseman, Nov 03 2022

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

			The 31st semiprime has prime indices (4,6), so the quotient is 4/6 = 2/3; hence a(31) = 2.

The divisible pairs are ranked by A318990, proper A339005.
The unreduced pair is (A338912, A338913).
The quotients of divisible pairs are A358103.
The restriction to divisible pairs is A358104, denominator A358105.
The denominator is A358193.
A000040 lists the primes.
A001222 counts prime indices, distinct A001221.
A001358 lists the semiprimes, squarefree A006881.
A003963 multiplies together prime indices.
A056239 adds up prime indices.
Cf. A000720, A027751, A128301, A215366, A289508, A289509, A296150, A300912, A318991, A358106.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Numerator/@Divide@@@primeMS/@Select[Range[100],PrimeOmega[#]==2&]

A358193 Denominator of the quotient of the prime indices of the n-th semiprime.

Original entry on oeis.org

1, 2, 1, 3, 4, 3, 2, 5, 1, 6, 5, 7, 4, 8, 3, 9, 1, 7, 5, 4, 10, 11, 2, 9, 12, 5, 13, 7, 14, 5, 3, 11, 15, 8, 16, 6, 3, 17, 7, 1, 18, 13, 7, 2, 19, 15, 20, 6, 10, 21, 11, 22, 8, 9, 23, 1, 17, 24, 9, 4, 7, 25, 19, 26, 5, 13, 27, 8, 10, 28, 14, 11, 29, 21, 7, 30

Offset: 1

Gus Wiseman, Nov 03 2022

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

			The 31-st semiprime has prime indices (4,6), so the quotient is 4/6 = 2/3; hence a(31) = 3.

The divisible pairs are ranked by A318990, proper A339005.
The unreduced pair is (A338912, A338913).
The quotients of divisible pairs are A358103.
The restriction to divisible pairs is A358105, numerator A358104.
The numerator is A358192.
A000040 lists the primes.
A001222 counts prime indices, distinct A001221.
A001358 lists the semiprimes, squarefree A006881.
A003963 multiplies together prime indices.
A056239 adds up prime indices.
Cf. A000720, A027751, A032741, A128301, A215366, A289508, A289509, A296150, A300912, A318991, A358106.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Denominator/@Divide@@@primeMS/@Select[Range[100],PrimeOmega[#]==2&]

A329554 Smallest MM-number of a set of n nonempty sets with no singletons.

Original entry on oeis.org

1, 13, 377, 16211, 761917, 55619941, 4393975339, 443791509239, 50148440544007, 6870336354528959, 954976753279525301, 142291536238649269849, 23193520406899830985387, 3873317907952271774559629, 701070541339361191195292849, 139513037726532877047863276951

Offset: 0

Gus Wiseman, Nov 17 2019

nonn

A multiset multisystem is a finite multiset of finite multisets. A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. The multiset multisystem with MM-number n is formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. For example, the prime indices of 78 are {1,2,6}, so the multiset multisystem with MM-number 78 is {{},{1},{1,2}}.

			The sequence of terms together with their corresponding systems begins:
       1: {}
      13: {{1,2}}
     377: {{1,2},{1,3}}
   16211: {{1,2},{1,3},{1,4}}
  761917: {{1,2},{1,3},{1,4},{2,3}}

The smallest BII-number of a set of n sets is A000225(n).
BII-numbers of set-systems with no singletons are A326781.
MM-numbers of sets of nonempty sets are the odd terms of A302494.
MM-numbers of multisets of nonempty non-singleton sets are A320629.
The version with empty edges is A329556.
The version with singletons is A329557.
The version with empty edges and singletons is A329558.
Cf. A056239, A072639, A112798, A279952, A302242, A326031, A329552, A329556.
Classes of MM-numbers: A305078 (connected), A316476 (antichains), A318991 (chains), A320456 (covers), A329559 (clutters).

sqvs=Select[Range[2,30],SquareFreeQ[#]&&!PrimeQ[#]&];
Table[Times@@Prime/@Take[sqvs,k],{k,0,Length[sqvs]}]

a(n) = Product_{i = 1..n} prime(A120944(i)).

A329556 Smallest MM-number of a set of n sets with no singletons.

Original entry on oeis.org

1, 2, 26, 754, 32422, 1523834

Offset: 0

Gus Wiseman, Nov 17 2019

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. The multiset of multisets with MM-number n is formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. For example, the prime indices of 78 are {1,2,6}, so the multiset of multisets with MM-number 78 is {{},{1},{1,2}}.

			The sequence of terms together with their corresponding systems begins:
        1: {}
        2: {{}}
       26: {{},{1,2}}
      754: {{},{1,2},{1,3}}
    32422: {{},{1,2},{1,3},{1,4}}
  1523834: {{},{1,2},{1,3},{1,4},{2,3}}

MM-numbers of sets of sets with no singletons are A329630.
The case without empty edges is A329554.
MM-numbers of sets of sets are A302494.
Cf. A056239, A112798, A302242, A329552, A329557, A329558.
Classes of MM-numbers: A305078 (connected), A316476 (antichains), A318991 (chains), A320456 (covers), A329559 (clutters).

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
dae=Select[Range[100000],SquareFreeQ[#]&&And@@SquareFreeQ/@primeMS[#]&&FreeQ[primeMS[#],_?PrimeQ]&];
Table[dae[[Position[PrimeOmega/@dae,k][[1,1]]]],{k,First[Split[Union[PrimeOmega/@dae],#2==#1+1&]]}]

cp's OEIS Frontend

A342523 Heinz numbers of integer partitions with weakly increasing first quotients.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A342530 Number of strict chains of divisors ending with n and having distinct first quotients.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A358103 Quotient of the n-th divisible pair, where pairs are ordered by Heinz number. Quotient of prime indices of A318990(n).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A358104 Unreduced numerator of the n-th divisible pair, where pairs are ordered by Heinz number. Greater prime index of A318990(n).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A358105 Unreduced denominator of the n-th divisible pair, where pairs are ordered by Heinz number. Lesser prime index of A318990(n).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A358106 Quotient of the n-th divisible pair, where pairs are ordered first by sum and then by denominator.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Formula

A358192 Numerator of the quotient of the prime indices of the n-th semiprime.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A358193 Denominator of the quotient of the prime indices of the n-th semiprime.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A329554 Smallest MM-number of a set of n nonempty sets with no singletons.