A383710 -id:A383710 - cp's OEIS frontend

A384011 Numbers k such that it is not possible to choose disjoint strict integer partitions of each conjugate prime index of k.

3, 5, 7, 9, 10, 11, 13, 14, 15, 17, 19, 20, 21, 22, 23, 25, 26, 28, 29, 31, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 55, 56, 57, 58, 59, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 73, 74, 75, 76, 77, 78, 79, 80, 82, 83, 84, 85

Offset: 1

Gus Wiseman, May 23 2025

nonn

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

			The terms together with their prime indices begin:
    3: {2}
    5: {3}
    7: {4}
    9: {2,2}
   10: {1,3}
   11: {5}
   13: {6}
   14: {1,4}
   15: {2,3}
   17: {7}
   19: {8}
   20: {1,1,3}
   21: {2,4}
   22: {1,5}
   23: {9}
   25: {3,3}
   26: {1,6}
   28: {1,1,4}

The conjugate is A382912.
These complement is counted by A383708, ranks A382913 or A384010.
These partitions are counted by A383710, conjugate A383711.
These are the positions of 0 in A384005, conjugate A383706.
A000041 counts integer partitions, strict A000009.
A048767 is the Look-and-Say transform, fixed points A048768, counted by A217605.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798.
A122111 represent conjugation in terms of Heinz numbers.
A239455 counts Look-and-Say or section-sum partitions, ranks A351294 or A381432.
A351293 counts non-Look-and-Say or non-section-sum partitions, ranks A351295 or A381433.
Cf. A098859, A130091, A279375, A279790, A357982, A382525, A383533, A383707.

pof[y_]:=Select[Join@@@Tuples[IntegerPartitions/@y],UnsameQ@@#&];
conj[y_]:=If[Length[y]==0,y,Table[Length[Select[y,#>=k&]],{k,1,Max[y]}]];
prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],pof[conj[prix[#]]]=={}&]

A384348 Number of integer partitions of n with no proper way to choose disjoint strict partitions of each part.

Original entry on oeis.org

1, 1, 2, 2, 4, 6, 7, 11, 17, 25, 30, 44, 61, 82, 113, 141, 193, 249, 327, 422, 548, 682, 881, 1106, 1400, 1751

Offset: 0

Gus Wiseman, May 30 2025

nonn

By "proper" we exclude the case of all singletons, which is disjoint when n is squarefree.

			For the partition y = (5,4,2,1) we have the following proper ways to choose strict partitions of each part:
  ((5),(3,1),(2),(1))
  ((4,1),(4,2),(1))
  ((4,1),(3,1),(2),(1))
  ((3,2),(4),(2),(1))
  ((3,2),(3,1),(2),(1))
But none of this is disjoint, so y is counted under a(12).
The a(1) = 1 through a(8) = 17 partitions:
  (1)  (2)   (21)   (22)    (32)     (222)     (322)      (332)
       (11)  (111)  (31)    (41)     (321)     (331)      (422)
                    (211)   (221)    (411)     (421)      (431)
                    (1111)  (311)    (2211)    (511)      (521)
                            (2111)   (3111)    (2221)     (611)
                            (11111)  (21111)   (3211)     (2222)
                                     (111111)  (4111)     (3221)
                                               (22111)    (3311)
                                               (31111)    (4211)
                                               (211111)   (5111)
                                               (1111111)  (22211)
                                                          (32111)
                                                          (41111)
                                                          (221111)
                                                          (311111)
                                                          (2111111)
                                                          (11111111)

The strict case is A179009, ranked by A383707.
This is the proper version of A383710, odd case A383711.
This is the proper complement of A383708, odd case A383533.
The complement is counted by A384317, ranks A384321.
The strict version for at least one proper choice is A384318, ranked by A384322.
For just one proper choice we have A384319, ranked by A384390.
For two choices we have A384323, ranks A384347 = positions of 2 in A383706.
These partitions are ranked by A384349.
For more than one proper choice we have A384395, ranked by A384393.
A000041 counts integer partitions, strict A000009.
A048767 is the Look-and-Say transform, fixed points A048768, counted by A217605.
A239455 counts Look-and-Say partitions, ranks A351294 or A381432.
A351293 counts non-Look-and-Say partitions, ranks A351295 or A381433.
Cf. A098859, A279790, A299200, A317142, A357982, A381454, A382525, A382912, A382913, A384005.

pofprop[y_]:=Select[DeleteCases[Join@@@Tuples[IntegerPartitions/@y],y],UnsameQ@@#&];
Table[Length[Select[IntegerPartitions[n],Length[pofprop[#]]==0&]],{n,0,15}]

A384391 Number of subsets of {1..n} containing n and some element that is a sum of distinct non-elements.

Original entry on oeis.org

0, 0, 1, 3, 9, 20, 48, 102, 219, 454, 945, 1920, 3925, 7921, 16008

Offset: 0

Gus Wiseman, Jun 06 2025

			The a(0) = 0 through a(6) = 20 subsets:
  .  .  .  {3}  {4}    {5}      {6}
                {2,4}  {1,5}    {1,6}
                {3,4}  {2,5}    {2,6}
                       {3,5}    {3,6}
                       {4,5}    {4,6}
                       {1,4,5}  {5,6}
                       {2,3,5}  {1,3,6}
                       {2,4,5}  {1,5,6}
                       {3,4,5}  {2,3,6}
                                {2,4,6}
                                {2,5,6}
                                {3,4,6}
                                {3,5,6}
                                {4,5,6}
                                {1,3,5,6}
                                {1,4,5,6}
                                {2,3,4,6}
                                {2,3,5,6}
                                {2,4,5,6}
                                {3,4,5,6}

The complement with n is counted by A179822, first differences of A326080.
Partial sums are A384350.
A048767 is the Look-and-Say transform, fixed points A048768, counted by A217605.
A179009 counts maximally refined strict partitions, ranks A383707.
A239455 counts Look-and-Say or section-sum partitions, ranks A351294 or A381432.
A351293 counts non-Look-and-Say or non-section-sum partitions, ranks A351295 or A381433.
A383706 counts ways to choose disjoint strict partitions of prime indices, non-disjoint A357982, non-strict A299200.
Cf. A279375, A279790, A317141, A317142, A326083, A383708, A383710, A384317, A384318, A384319, A384320, A384321.

nonsets[y_]:=If[Length[y]==0,{},Rest[Subsets[Complement[Range[Max@@y],y]]]];
Table[Length[Select[Subsets[Range[n]],MemberQ[#,n]&&Intersection[#,Total/@nonsets[#]]!={}&]],{n,0,10}]

A384392 Number of integer partitions of n whose distinct parts are maximally refined.

Original entry on oeis.org

1, 1, 2, 2, 4, 6, 7, 10, 14, 20, 24, 33, 41, 55, 70, 88, 110, 140, 171, 214, 265, 324, 397, 485, 588, 711, 861, 1032, 1241, 1486, 1773

Offset: 0

Gus Wiseman, Jun 07 2025

Given any partition, the following are equivalent:
1) The distinct parts are maximally refined.
2) Every strict partition of a part contains a part. In other words, if y is the set of parts and z is any strict partition of any element of y, then z must contain at least one element from y.
3) No part is a sum of distinct non-parts.

			The a(1) = 1 through a(8) = 14 partitions:
  (1)  (2)   (21)   (22)    (32)     (222)     (322)      (332)
       (11)  (111)  (31)    (41)     (321)     (331)      (431)
                    (211)   (221)    (411)     (421)      (521)
                    (1111)  (311)    (2211)    (2221)     (2222)
                            (2111)   (3111)    (3211)     (3221)
                            (11111)  (21111)   (4111)     (3311)
                                     (111111)  (22111)    (4211)
                                               (31111)    (22211)
                                               (211111)   (32111)
                                               (1111111)  (41111)
                                                          (221111)
                                                          (311111)
                                                          (2111111)
                                                          (11111111)

The strict case is A179009, ranks A383707.
For subsets instead of partitions we have A326080, complement A384350.
These partitions are ranked by A384320, complement A384321.
A048767 is the Look-and-Say transform, fixed points A048768, counted by A217605.
A239455 counts Look-and-Say or section-sum partitions, ranks A351294 or A381432.
A351293 counts non-Look-and-Say or non-section-sum partitions, ranks A351295 or A381433.
Cf. A179822, A279375, A279790, A299200, A317142, A326083, A357982, A383706, A383708, A383710, A384317, A384318, A384319, A384391.

nonsets[y_]:=If[Length[y]==0,{},Rest[Subsets[Complement[Range[Max@@y],y]]]];
Table[Length[Select[IntegerPartitions[n],Intersection[#,Total/@nonsets[#]]=={}&]],{n,0,15}]

A384394 Number of proper ways to choose disjoint strict integer partitions, one of each conjugate prime index of n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0

Offset: 1

Gus Wiseman, Jun 03 2025

nonn

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.

By "proper" we exclude the case of all singletons.

			The prime indices of 216 are {1,1,1,2,2,2}, with conjugate partition (6,3), with proper choices ((6),(2,1)), ((5,1),(3)), and ((4,2),(3)), so a(216) = 3.

Conjugate prime indices are the rows of A122111.
The non-proper version is A384005, conjugate A383706.
This is the conjugate version of A384389 (firsts A384396).
A000041 counts integer partitions, strict A000009.
A048767 is the Look-and-Say transform, fixed points A048768, counted by A217605.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798.
A239455 counts Look-and-Say or section-sum partitions, ranks A351294 or A381432.
A351293 counts non-Look-and-Say or non-section-sum partitions, ranks A351295 or A381433.
See also A382912, counted by A383710, odd case A383711.
See also A382913, counted by A383708, odd case A383533.
Cf. A279790, A357982, A381454, A382525, A384321, A384322, A384347, A384349, A384390, A384393.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
conj[y_]:=If[Length[y]==0,y,Table[Length[Select[y,#>=k&]],{k,1,Max[y]}]];
pofprop[y_]:=Select[DeleteCases[Join@@@Tuples[IntegerPartitions/@y],y],UnsameQ@@#&];
Table[Length[pofprop[conj[prix[n]]]],{n,100}]

A384395 Number of integer partitions of n with more than one proper way to choose disjoint strict partitions of each part.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 2, 1, 4, 5, 8, 8, 12, 17, 22, 29, 31, 40, 50, 65, 77, 101, 112, 135, 162, 201

Offset: 0

Gus Wiseman, May 30 2025

By "proper" we exclude the case of all singletons, which is disjoint when n is squarefree.

			For the partition (8,5,2) we have four choices:
  ((8),(4,1),(2))
  ((7,1),(5),(2))
  ((5,3),(4,1),(2))
  ((4,3,1),(5),(2))
Hence (8,5,2) is counted under a(15).
The a(5) = 1 through a(12) = 12 partitions:
  (5)  (6)    (7)  (8)    (9)    (10)     (11)     (12)
       (3,3)       (4,4)  (5,4)  (5,5)    (6,5)    (6,6)
                   (5,3)  (6,3)  (6,4)    (7,4)    (7,5)
                   (7,1)  (7,2)  (7,3)    (8,3)    (8,4)
                          (8,1)  (8,2)    (9,2)    (9,3)
                                 (9,1)    (10,1)   (10,2)
                                 (4,3,3)  (5,3,3)  (11,1)
                                 (4,4,2)  (5,5,1)  (5,5,2)
                                                   (6,3,3)
                                                   (6,4,2)
                                                   (6,5,1)
                                                   (9,2,1)

For just one choice we have A179009, ranked by A383707.
Twice-partitions of this type are counted by A279790.
For at least one choice we have A383708, odd case A383533.
For no choices we have A383710, odd case A383711.
For at least one proper choice we have A384317, ranked by A384321.
The strict version for at least one proper choice is A384318, ranked by A384322.
The strict version for just one proper choice is A384319, ranked by A384390.
For just one proper choice we have A384323, ranks A384347 = positions of 2 in A383706.
For no proper choices we have A384348, ranked by A384349.
These partitions are ranked by A384393.
A000041 counts integer partitions, strict A000009.
A048767 is the Look-and-Say transform, fixed points A048768, counted by A217605.
A239455 counts Look-and-Say partitions, ranks A351294 or A381432.
A351293 counts non-Look-and-Say partitions, ranks A351295 or A381433.
A357982 counts choices of strict partitions of each prime index, non-strict A299200.
Cf. A098859, A279375, A317142, A381454, A382525, A382912, A382913, A384005.

pofprop[y_]:=Select[DeleteCases[Join@@@Tuples[IntegerPartitions/@y],y],UnsameQ@@#&];
Table[Length[Select[IntegerPartitions[n],Length[pofprop[#]]>1&]],{n,0,15}]

A384396 Position of first appearance of n in A384389 (proper choices of disjoint strict partitions of each prime index).

Original entry on oeis.org

1, 5, 11, 13, 17, 19, 62, 23, 111, 29, 123, 31, 129, 217, 37, 141, 106, 41, 159, 391, 118, 43

Offset: 0

Gus Wiseman, Jun 03 2025

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.

By "proper" we exclude the case of all singletons, which is disjoint when n is squarefree.

Positions of first appearances in A384389.
A000041 counts integer partitions, strict A000009.
A048767 is the Look-and-Say transform, fixed points A048768, counted by A217605.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798.
A239455 counts Look-and-Say partitions, ranks A351294
A351293 counts non-Look-and-Say partitions, ranks A351295.
Cf. A382912, A383710, A382913, A383708.
Cf. A179009, A279790, A357982, A381454, A382525, A383706, A384321, A384322, A384347, A384349, A384390, A384393.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
pofprop[y_]:=Select[DeleteCases[Join@@@Tuples[IntegerPartitions/@y],y],UnsameQ@@#&];
lv=Table[Length[pofprop[prix[n]]],{n,100}];
mnrm[s_]:=If[Min@@s==1,mnrm[DeleteCases[s-1,0]]+1,0];
Table[Position[lv,x][[1,1]],{x,0,mnrm[lv+1]-1}]

A384179 Number of ways to choose strict integer partitions of each conjugate prime index of n.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 4, 2, 1, 2, 1, 3, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 4, 1, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1, 1, 1, 2, 1, 1, 4, 4, 1, 2, 1, 2, 1, 2, 1, 3, 1, 1, 4, 2, 1, 2, 1, 3, 4, 1, 1, 2, 1, 1, 1

Offset: 1

Gus Wiseman, May 23 2025

nonn

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 prime indices of 180 are {1,1,2,2,3}, conjugate {5,3,1}, and we have choices:
  {{5},{3},{1}}
  {{5},{2,1},{1}}
  {{4,1},{3},{1}}
  {{4,1},{2,1},{1}}
  {{3,2},{3},{1}}
  {{3,2},{2,1},{1}}
so a(180) = 6.

Positions of 1 are A037143, complement A033942.
For multiplicities instead of indices we have A050361.
Adding up over all integer partitions gives A270995, disjoint A279790, strict A279375.
The conjugate version is A357982, disjoint A383706.
The disjoint case is A384005.
A000041 counts integer partitions, strict A000009.
A048767 is the Look-and-Say transform, fixed points A048768, counted by A217605.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798.
A239455 counts Look-and-Say or section-sum partitions, ranks A351294 or A381432.
A351293 counts non Look-and-Say or non section-sum partitions, ranks A351295 or A381433.
Cf. A122111, A130091, A179009, A382913, A383707, A383710, A384010, A384011.

fop[y_]:=Join@@@Tuples[strptns/@y];
conj[y_]:=If[Length[y]==0,y,Table[Length[Select[y,#>=k&]],{k,1,Max[y]}]];
prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Length[fop[conj[prix[n]]]],{n,100}]

cp's OEIS Frontend

A384011 Numbers k such that it is not possible to choose disjoint strict integer partitions of each conjugate prime index of k.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A384348 Number of integer partitions of n with no proper way to choose disjoint strict partitions of each part.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A384391 Number of subsets of {1..n} containing n and some element that is a sum of distinct non-elements.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A384392 Number of integer partitions of n whose distinct parts are maximally refined.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A384394 Number of proper ways to choose disjoint strict integer partitions, one of each conjugate prime index of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A384395 Number of integer partitions of n with more than one proper way to choose disjoint strict partitions of each part.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A384396 Position of first appearance of n in A384389 (proper choices of disjoint strict partitions of each prime index).

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

A384179 Number of ways to choose strict integer partitions of each conjugate prime index of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica