A317246 -id:A317246 - cp's OEIS frontend

A317245 Number of supernormal integer partitions of n.

1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 4, 4, 1, 3, 3, 4, 2, 4, 5, 6, 6, 10, 7, 10, 9, 9, 10, 11, 12, 12, 21, 12, 18, 17, 21, 19, 28, 23, 28, 26, 27, 24, 32, 29, 36, 34, 46, 42, 55, 48, 65, 65, 74, 70, 88, 81, 83, 103, 112, 129, 153, 157, 190, 205, 210, 242, 283, 276, 321

Offset: 0

Gus Wiseman, Jul 24 2018

nonn

An integer partition is supernormal if either (1) it is of the form 1^n for some n >= 0, or (2a) it spans an initial interval of positive integers, and (2b) its multiplicities, sorted in weakly decreasing order, are themselves a supernormal integer partition.

			The a(10) = 4 supernormal integer partitions are (4321), (33211), (322111), (1111111111).
The a(21) = 10 supernormal integer partitions:
  (654321),
  (4443321),
  (44432211), (44333211), (44332221),
  (4432221111), (4333221111), (4332222111),
  (433322211),
  (111111111111111111111).

Cf. A000041, A181819, A182850, A182857, A275870, A304660, A305563, A317081, A317086, A317088, A317246.

supnrm[q_]:=Or[q=={}||Union[q]=={1},And[Union[q]==Range[Max[q]],supnrm[Sort[Length/@Split[q],Greater]]]];
Table[Length[Select[IntegerPartitions[n],supnrm]],{n,0,30}]

A317491 Number of fully normal integer partitions of n.

Original entry on oeis.org

1, 1, 2, 3, 4, 6, 6, 10, 12, 17, 21, 30, 33, 46, 50, 68, 77, 100, 112, 146, 167, 201, 234, 290, 326, 400, 456, 545, 622, 744, 845, 1004, 1153, 1351, 1551, 1819, 2103, 2434, 2808, 3248, 3735, 4304, 4943, 5661, 6506, 7446, 8499, 9657, 11070, 12505, 14325, 16183

Offset: 0

Gus Wiseman, Jul 30 2018

nonn

An integer partition is fully normal if either it is of the form (1,1,...,1) or its multiplicities span an initial interval of positive integers and, sorted in weakly decreasing order, are themselves fully normal.

			The a(6) = 6 fully normal partitions are (6), (51), (42), (411), (321), (111111). Missing from this list are (33), (3111), (222), (2211), (21111).

Cf. A181819, A182850, A182857, A275870, A304660, A305563, A317081, A317086, A317088, A317246, A317492, A317493.

fulnrmQ[ptn_]:=With[{qtn=Sort[Length/@Split[ptn],Greater]},Or[ptn=={}||Union[ptn]=={1},And[Union[qtn]==Range[Max[qtn]],fulnrmQ[qtn]]]];
Table[Length[Select[IntegerPartitions[n],fulnrmQ]],{n,0,30}]

a(n) = A317245(n) iff n is 1 or a prime number.

A317257 Heinz numbers of alternately co-strong integer partitions.

Original entry on oeis.org

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, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 51, 52, 53, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70

Offset: 1

Gus Wiseman, Jul 25 2018

nonn

The first term absent from this sequence but present in A242031 is 180.
A sequence is alternately co-strong if either it is empty, equal to (1), or its run-lengths are weakly increasing (co-strong) and, when reversed, are themselves an alternately co-strong sequence.
The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

			The sequence of terms together with their prime indices begins:
    1: {}          16: {1,1,1,1}     32: {1,1,1,1,1}
    2: {1}         17: {7}           33: {2,5}
    3: {2}         19: {8}           34: {1,7}
    4: {1,1}       20: {1,1,3}       35: {3,4}
    5: {3}         21: {2,4}         36: {1,1,2,2}
    6: {1,2}       22: {1,5}         37: {12}
    7: {4}         23: {9}           38: {1,8}
    8: {1,1,1}     24: {1,1,1,2}     39: {2,6}
    9: {2,2}       25: {3,3}         40: {1,1,1,3}
   10: {1,3}       26: {1,6}         41: {13}
   11: {5}         27: {2,2,2}       42: {1,2,4}
   12: {1,1,2}     28: {1,1,4}       43: {14}
   13: {6}         29: {10}          44: {1,1,5}
   14: {1,4}       30: {1,2,3}       45: {2,2,3}
   15: {2,3}       31: {11}          46: {1,9}

Robert Price, Table of n, a(n) for n = 1..10000

Cf. A056239, A100883, A181819, A182850, A242031, A296150, A305732, A317246.
These partitions are counted by A317256.
The complement is A317258.
Totally co-strong partitions are counted by A332275.
Alternately co-strong compositions are counted by A332338.
Alternately co-strong reversed partitions are counted by A332339.
The total version is A335376.
Cf. A182857, A304660, A305563, A316496, A332292, A332340.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
totincQ[q_]:=Or[Length[q]<=1,And[OrderedQ[Length/@Split[q]],totincQ[Reverse[Length/@Split[q]]]]];
Select[Range[100],totincQ[Reverse[primeMS[#]]]&]

Updated with corrected terminology by Gus Wiseman, Jun 04 2020

A332291 Heinz numbers of widely totally strongly normal integer partitions.

Original entry on oeis.org

1, 2, 4, 6, 8, 16, 18, 30, 32, 64, 128, 210, 256, 450, 512, 1024, 2048, 2250, 2310, 4096, 8192, 16384, 30030, 32768, 65536, 131072, 262144, 510510, 524288

Offset: 1

Gus Wiseman, Feb 14 2020

An integer partition is widely totally strongly normal if either it is constant 1's (wide) or it covers an initial interval of positive integers (normal) and has weakly decreasing run-lengths (strong) which are themselves a widely totally strongly normal partition.
The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).
This sequence is closed under A304660, so there are infinitely many terms that are not powers of 2 or primorial numbers.

			The sequence of all widely totally strongly normal integer partitions together with their Heinz numbers begins:
      1: ()
      2: (1)
      4: (1,1)
      6: (2,1)
      8: (1,1,1)
     16: (1,1,1,1)
     18: (2,2,1)
     30: (3,2,1)
     32: (1,1,1,1,1)
     64: (1,1,1,1,1,1)
    128: (1,1,1,1,1,1,1)
    210: (4,3,2,1)
    256: (1,1,1,1,1,1,1,1)
    450: (3,3,2,2,1)
    512: (1,1,1,1,1,1,1,1,1)
   1024: (1,1,1,1,1,1,1,1,1,1)
   2048: (1,1,1,1,1,1,1,1,1,1,1)
   2250: (3,3,3,2,2,1)
   2310: (5,4,3,2,1)
   4096: (1,1,1,1,1,1,1,1,1,1,1,1)

Closed under A304660.
The non-strong version is A332276.
The co-strong version is A332293.
The case of reversed partitions is (also) A332293.
Heinz numbers of normal partitions with decreasing run-lengths are A025487.
Cf. A055932, A056239, A181819, A242031, A317089, A317246, A317257, A317492, A329747, A332277, A332278, A332290, A332292, A332297, A332337.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
totnQ[ptn_]:=Or[ptn=={},Union[ptn]=={1},And[Union[ptn]==Range[Max[ptn]],GreaterEqual@@Length/@Split[ptn],totnQ[Length/@Split[ptn]]]];
Select[Range[10000],totnQ[Reverse[primeMS[#]]]&]

A317492 Heinz numbers of fully normal integer partitions.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 26, 28, 29, 30, 31, 32, 33, 34, 35, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 53, 55, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 73, 74, 75, 76, 77, 78

Offset: 1

Gus Wiseman, Jul 30 2018

nonn

An integer partition is fully normal if either it is of the form (1,1,...,1) or its multiplicities span an initial interval of positive integers and, sorted in weakly decreasing order, are themselves fully normal.

Cf. A055932, A056239, A181819, A182850, A296150, A305732, A317089, A317090, A317245, A317246, A317491, A317493.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
fulnrmQ[ptn_]:=With[{qtn=Sort[Length/@Split[ptn],Greater]},Or[ptn=={}||Union[ptn]=={1},And[Union[qtn]==Range[Max[qtn]],fulnrmQ[qtn]]]];
Select[Range[100],fulnrmQ[Reverse[primeMS[#]]]&]

A332276 Heinz numbers of widely totally normal integer partitions.

Original entry on oeis.org

1, 2, 4, 6, 8, 12, 16, 18, 30, 32, 60, 64, 90, 128, 150, 180, 210, 256, 300, 360, 450, 512, 540, 600, 630, 1024, 1050, 1350, 1500, 2048, 2100, 2250, 2310, 2520, 2940, 3150, 3780, 4096, 4200, 4410, 5880, 8192, 8820, 9450, 10500, 11550, 12600, 13230, 14700

Offset: 1

Gus Wiseman, Feb 12 2020

nonn

First differs from A317246 in having 630.
A sequence of positive integers is widely totally normal if either it is all 1's (wide) or it covers an initial interval of positive integers (normal) and has widely totally normal run-lengths.
The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

			The sequence of terms together with their prime indices begins:
    1: {}
    2: {1}
    4: {1,1}
    6: {1,2}
    8: {1,1,1}
   12: {1,1,2}
   16: {1,1,1,1}
   18: {1,2,2}
   30: {1,2,3}
   32: {1,1,1,1,1}
   60: {1,1,2,3}
   64: {1,1,1,1,1,1}
   90: {1,2,2,3}
  128: {1,1,1,1,1,1,1}
  150: {1,2,3,3}
  180: {1,1,2,2,3}
  210: {1,2,3,4}
  256: {1,1,1,1,1,1,1,1}
  300: {1,1,2,3,3}
  360: {1,1,1,2,2,3}
For example, starting with (4,3,2,2,1), the partition with Heinz number 630, and repeatedly taking run-lengths gives (4,3,2,2,1) -> (1,1,2,1) -> (2,1,1) -> (1,2) -> (1,1). These are all normal and the last is all 1's, so 630 belongs to the sequence.

Contains all powers of two A000079 and the primorials A002110.
Heinz numbers of normal integer partitions are A055932.
The case of reversed integer partitions is A332276 (this sequence).
The enumeration of these partitions by sum is A332277.
The enumeration of the generalization to compositions is A332279.
The co-strong version is A332290.
The strong version is A332291.
Cf. A007097, A056239, A133808, A181819, A182850, A305732, A317081, A317089, A317090, A317246, A317492, A329747, A332295, A332296.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
gnaQ[y_]:=Or[y=={},Union[y]=={1},And[Union[y]==Range[Max[y]],gnaQ[Length/@Split[y]]]];
Select[Range[1000],gnaQ[primeMS[#]]&]

A319151 Heinz numbers of superperiodic integer partitions.

Original entry on oeis.org

2, 3, 5, 7, 9, 11, 13, 17, 19, 23, 25, 27, 29, 31, 37, 41, 43, 47, 49, 53, 59, 61, 67, 71, 73, 79, 81, 83, 89, 97, 101, 103, 107, 109, 113, 121, 125, 127, 131, 137, 139, 149, 151, 157, 163, 167, 169, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233

Offset: 1

Gus Wiseman, Sep 12 2018

nonn

First differs from A061345 at a(1) = 2 and next at a(98) = 441.
A number n is in the sequence iff n = 2 or the prime indices of n have a common divisor > 1 and the Heinz number of the multiset of prime multiplicities of n, namely A181819(n), is already in the sequence.
The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).

			The sequence of partitions whose Heinz numbers belong to the sequence begins: (1), (2), (3), (4), (2,2), (5), (6), (7), (8), (9), (3,3), (2,2,2), (10), (11), (12), (13), (14), (15), (4,4), (16), (17), (18), (19), (20), (21), (22), (2,2,2,2).

Vincenzo Librandi, Table of n, a(n) for n = 1..2326

Cf. A001597, A056239, A072774, A098859, A181819, A182850, A289509, A296150, A298748, A304464, A305732, A317246, A317257, A319149, A319152, A319157.

supperQ[n_]:=Or[n==2,And[GCD@@PrimePi/@FactorInteger[n][[All,1]]>1,supperQ[Times@@Prime/@FactorInteger[n][[All,2]]]]];
Select[Range[500],supperQ]

A332290 Heinz numbers of widely alternately co-strongly normal integer partitions.

Original entry on oeis.org

1, 2, 4, 6, 8, 12, 16, 30, 32, 60, 64, 128, 210, 256, 360, 512, 1024, 2048, 2310, 2520, 4096, 8192, 16384, 30030, 32768, 65536, 75600, 131072, 262144, 510510, 524288

Offset: 1

Gus Wiseman, Feb 14 2020

An integer partition is widely alternately co-strongly normal if either it is constant 1's (wide) or it covers an initial interval of positive integers (normal) and has weakly increasing run-lengths (co-strong) which, if reversed, are themselves a widely alternately co-strongly normal partition.
The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).
This sequence is closed under A181821, so there are infinitely many terms that are not powers of 2 or primorial numbers.

			The sequence of all widely alternately co-strongly normal integer partitions together with their Heinz numbers begins:
      1: ()
      2: (1)
      4: (1,1)
      6: (2,1)
      8: (1,1,1)
     12: (2,1,1)
     16: (1,1,1,1)
     30: (3,2,1)
     32: (1,1,1,1,1)
     60: (3,2,1,1)
     64: (1,1,1,1,1,1)
    128: (1,1,1,1,1,1,1)
    210: (4,3,2,1)
    256: (1,1,1,1,1,1,1,1)
    360: (3,2,2,1,1,1)
    512: (1,1,1,1,1,1,1,1,1)
   1024: (1,1,1,1,1,1,1,1,1,1)
   2048: (1,1,1,1,1,1,1,1,1,1,1)
   2310: (5,4,3,2,1)
   2520: (4,3,2,2,1,1,1)
For example, starting with y = (4,3,2,2,1,1,1), which has Heinz number 2520, and repeatedly taking run-lengths and reversing gives (4,3,2,2,1,1,1) -> (3,2,1,1) -> (2,1,1) -> (2,1) -> (1,1). These are all normal with weakly increasing run-lengths and the last is all 1's, so 2520 belongs to the sequence.

Closed under A181821.
The non-co-strong version is A332276.
The enumeration of these partitions by sum is A332289.
The total (rather than alternating) version is A332293.
Cf. A055932, A056239, A100883, A133808, A181819, A317089, A317090, A317246, A317257, A317492, A329747, A332292, A332340.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
totnQ[ptn_]:=Or[ptn=={},Union[ptn]=={1},And[Union[ptn]==Range[Max[ptn]],LessEqual@@Length/@Split[ptn],totnQ[Reverse[Length/@Split[ptn]]]]];
Select[Range[10000],totnQ[Reverse[primeMS[#]]]&]

A332293 Heinz numbers of widely totally co-strongly normal integer partitions.

Original entry on oeis.org

1, 2, 4, 6, 8, 12, 16, 30, 32, 64, 128, 180, 210, 256, 360, 512, 1024, 2048, 2310, 4096, 8192, 16384, 30030, 32768, 65536, 75600, 131072, 262144, 510510, 524288

Offset: 1

Gus Wiseman, Feb 16 2020

An integer partition is widely totally co-strongly normal if either it is constant 1's (wide) or it covers an initial interval of positive integers (normal) and has weakly increasing run-lengths (co-strong) which are themselves a widely totally co-strongly normal partition.

The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

			The sequence of terms together with their prime indices begins:
     1: {}
     2: {1}
     4: {1,1}
     6: {1,2}
     8: {1,1,1}
    12: {1,1,2}
    16: {1,1,1,1}
    30: {1,2,3}
    32: {1,1,1,1,1}
    64: {1,1,1,1,1,1}
   128: {1,1,1,1,1,1,1}
   180: {1,1,2,2,3}
   210: {1,2,3,4}
   256: {1,1,1,1,1,1,1,1}
   360: {1,1,1,2,2,3}
   512: {1,1,1,1,1,1,1,1,1}
  1024: {1,1,1,1,1,1,1,1,1,1}
  2048: {1,1,1,1,1,1,1,1,1,1,1}
  2310: {1,2,3,4,5}
  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}
For example, 180 is the Heinz number of (3,2,2,1,1), with run-lengths (3,2,2,1,1) -> (1,2,2) -> (1,2) -> (1,1). These are all normal with weakly increasing multiplicities and the last is all 1's, so 180 belongs to the sequence.

A subset of A055932.
Closed under A181819.
The non-co-strong version is A332276.
The enumeration of these partitions by sum is A332278.
The alternating version is A332290.
The strong version is A332291.
The case of reversed partitions is (also) A332291.
Cf. A000009, A056239, A133808, A182850, A304660, A317089, A317246, A317257, A317492, A329747, A332277, A332289.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
normQ[m_]:=m=={}||Union[m]==Range[Max[m]];
gnaQ[y_]:=Or[y=={},Union[y]=={1},And[normQ[y],LessEqual@@Length/@Split[y],gnaQ[Length/@Split[y]]]];
Select[Range[1000],gnaQ[Reverse[primeMS[#]]]&]

A316529 Heinz numbers of totally strong integer partitions.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 18, 19, 21, 22, 23, 25, 26, 27, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 46, 47, 49, 50, 51, 53, 54, 55, 57, 58, 59, 61, 62, 64, 65, 66, 67, 69, 70, 71, 73, 74, 75, 77, 78, 79, 81, 82, 83

Offset: 1

Gus Wiseman, Jul 29 2018

nonn

First differs from A304678 at a(115) = 151, A304678(115) = 150.
The alternating version first differs from this sequence in having 150 and lacking 450.
An integer partition is totally strong if either it is empty, equal to (1), or its run-lengths are weakly decreasing (strong) and are themselves a totally strong partition.
The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.

			Starting with (3,3,2,1), which has Heinz number 150, and repeatedly taking run-lengths gives (3,3,2,1) -> (2,1,1) -> (1,2), so 150 is not in the sequence.
Starting with (3,3,2,2,1), which has Heinz number 450, and repeatedly taking run-lengths gives (3,3,2,2,1) -> (2,2,1) -> (2,1) -> (1,1) -> (2) -> (1), so 450 is in the sequence.

Cf. A056239, A181819, A182850, A242031, A296150, A305732, A317246.
The enumeration of these partitions by sum is A316496.
The complement is A316597.
The widely normal version is A332291.
The dual version is A335376.
Partitions with weakly decreasing run-lengths are A100882.
Cf. A025487, A100883, A133808, A317257, A332275, A332293, A332297.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
totstrQ[q_]:=Or[q=={},q=={1},And[GreaterEqual@@Length/@Split[q],totstrQ[Length/@Split[q]]]];
Select[Range[100],totstrQ[Reverse[primeMS[#]]]&]

Updated with corrected terminology by Gus Wiseman, Mar 08 2020

cp's OEIS Frontend

A317245 Number of supernormal integer partitions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A317491 Number of fully normal integer partitions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A317257 Heinz numbers of alternately co-strong integer partitions.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A332291 Heinz numbers of widely totally strongly normal integer partitions.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A317492 Heinz numbers of fully normal integer partitions.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

A332276 Heinz numbers of widely totally normal integer partitions.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A319151 Heinz numbers of superperiodic integer partitions.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A332290 Heinz numbers of widely alternately co-strongly normal integer partitions.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A332293 Heinz numbers of widely totally co-strongly normal integer partitions.

Views

Author

Keywords