A332276 -id:A332276 - cp's OEIS frontend

A332277 Number of widely totally normal integer partitions of n.

1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 4, 4, 2, 4, 4, 6, 3, 5, 7, 6, 8, 12, 9, 12, 13, 11, 12, 18, 17, 12, 32, 19, 25, 33, 30, 28, 44, 33, 43, 57, 51, 60, 83, 70, 83, 103, 96, 97, 125, 117, 134, 157, 157, 171, 226, 215, 238, 278, 302, 312, 359, 357, 396, 450, 444, 477, 580

Offset: 0

Gus Wiseman, Feb 12 2020

nonn

A sequence 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.

Also the number of widely totally normal reversed integer partitions of n.

			The a(n) partitions for n = 1, 4, 10, 11, 16, 18:
  1  211   4321        33221        443221            543321
     1111  33211       322211       4432111           4333221
           322111      332111       1111111111111111  4432221
           1111111111  11111111111                    4433211
                                                      43322211
                                                      44322111
                                                      111111111111111111

Normal partitions are A000009.
Taking multiplicities instead of run-lengths gives A317245.
Constantly recursively normal partitions are A332272.
The Heinz numbers of these partitions are A332276.
The case of all compositions (not just partitions) is A332279.
The co-strong version is A332278.
The recursive version is A332295.
The narrow version is a(n) + 1 for n > 1.
Cf. A181819, A316496, A317081, A317256, A317491, A317588, A329746, A329747, A332289, A332290, A332291, A332296, A332297, A332336, A332337, A332340.

recnQ[ptn_]:=Or[ptn=={},Union[ptn]=={1},And[Union[ptn]==Range[Max[ptn]],recnQ[Length/@Split[ptn]]]];
Table[Length[Select[IntegerPartitions[n],recnQ]],{n,0,30}]

a(61)-a(66) from Jinyuan Wang, Jun 26 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[#]]]&]

A332337 Number of widely totally strongly normal compositions of n.

Original entry on oeis.org

1, 1, 1, 3, 3, 3, 9, 9, 12, 23, 54, 77, 116, 205, 352, 697, 1174, 2013, 3538, 6209, 10830

Offset: 0

Gus Wiseman, Feb 15 2020

A sequence is widely totally strongly normal if either it is all 1's (wide) or it covers an initial interval of positive integers (normal) and has weakly decreasing run-lengths (strong) that are themselves a widely totally strongly normal sequence.

			The a(1) = 1 through a(8) = 12 compositions:
  (1)  (11)  (12)   (112)   (212)    (123)     (1213)     (1232)
             (21)   (121)   (221)    (132)     (1231)     (2123)
             (111)  (1111)  (11111)  (213)     (1312)     (2132)
                                     (231)     (1321)     (2312)
                                     (312)     (2131)     (2321)
                                     (321)     (3121)     (3212)
                                     (1212)    (11221)    (12131)
                                     (2121)    (12121)    (13121)
                                     (111111)  (1111111)  (21212)
                                                          (22112)
                                                          (111221)
                                                          (11111111)
For example, starting with (22112) and repeated taking run-lengths gives (22112) -> (221) -> (21) -> (11). These are all normal with weakly decreasing run-lengths, and the last is all 1's, so (22112) is counted under a(8).

Normal compositions are A107429.
The case of partitions is A332278.
The non-strong version is A332279.
Heinz numbers in the case of partitions are A332291.
The narrow version is A332336.
The alternating version is A332340.
The co-strong version is this same sequence.
Cf. A025487, A100883, A181819, A317245, A317491, A329744, A332274, A332276, A332277, A332292, A332293, A332296.

totnQ[ptn_]:=Or[ptn=={},Union[ptn]=={1},And[Union[ptn]==Range[Max[ptn]],LessEqual@@Length/@Split[ptn],totnQ[Length/@Split[ptn]]]];
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],totnQ]],{n,0,10}]

For n > 1, a(n) = A332336(n) - 1.

A332296 Number of narrowly totally normal compositions of n.

Original entry on oeis.org

1, 1, 2, 4, 5, 7, 13, 23, 30, 63, 120, 209, 369, 651, 1198, 2174, 3896, 7023, 12699, 22941, 41565

Offset: 0

Gus Wiseman, Feb 15 2020

A sequence is narrowly totally normal if either it is empty, a singleton (narrow), or it covers an initial interval of positive integers (normal) with narrowly totally normal run-lengths.

A composition of n is a finite sequence of positive integers summing to n.

			The a(0) = 1 through a(6) = 13 compositions:
  ()  (1)  (2)   (3)    (4)     (5)      (6)
           (11)  (12)   (112)   (122)    (123)
                 (21)   (121)   (212)    (132)
                 (111)  (211)   (221)    (213)
                        (1111)  (1121)   (231)
                                (1211)   (312)
                                (11111)  (321)
                                         (1212)
                                         (1221)
                                         (2112)
                                         (2121)
                                         (11211)
                                         (111111)
For example, starting with the composition (1,1,2,3,1,1) and repeatedly taking run-lengths gives (1,1,2,3,1,1) -> (2,1,1,2) -> (1,2,1) -> (1,1,1) -> (3). The first four are normal and the last is a singleton, so (1,1,2,3,1,1) is counted under a(9).

Normal compositions are A107429.
The wide version is A332279.
The wide recursive version (for partitions) is A332295.
The alternating version is A332296 (this sequence).
The strong version is A332336.
The co-strong version is (also) A332336.
Cf. A001462, A316496, A317081, A317245, A317491, A329744, A332276, A332277, A332278, A332297, A332337, A332340.

tinQ[q_]:=Or[Length[q]<=1,And[Union[q]==Range[Max[q]],tinQ[Length/@Split[q]]]];
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],tinQ]],{n,0,10}]

For n > 1, a(n) = A332279(n) + 1.

A332279 Number of widely totally normal compositions of n.

Original entry on oeis.org

1, 1, 1, 3, 4, 6, 12, 22, 29, 62, 119, 208, 368, 650, 1197, 2173, 3895, 7022, 12698, 22940, 41564

Offset: 0

Gus Wiseman, Feb 12 2020

A sequence 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.

A composition of n is a finite sequence of positive integers with sum n.

			The a(1) = 1 through a(7) = 22 compositions:
  (1)  (11)  (12)   (112)   (122)    (123)     (1123)
             (21)   (121)   (212)    (132)     (1132)
             (111)  (211)   (221)    (213)     (1213)
                    (1111)  (1121)   (231)     (1231)
                            (1211)   (312)     (1312)
                            (11111)  (321)     (1321)
                                     (1212)    (2113)
                                     (1221)    (2122)
                                     (2112)    (2131)
                                     (2121)    (2212)
                                     (11211)   (2311)
                                     (111111)  (3112)
                                               (3121)
                                               (3211)
                                               (11221)
                                               (12112)
                                               (12121)
                                               (12211)
                                               (21121)
                                               (111211)
                                               (112111)
                                               (1111111)
For example, starting with y = (3,2,1,1,2,2,2,1,2,1,1,1,1) and repeatedly taking run-lengths gives y -> (1,1,2,3,1,1,4) -> (2,1,1,2,1) -> (1,2,1,1) -> (1,1,2) -> (2,1) -> (1,1). These are all normal and the last is all 1's, so y is counted under a(20).

Normal compositions are A107429.
Constantly recursively normal partitions are A332272.
The case of partitions is A332277.
The case of reversed partitions is (also) A332277.
The narrow version is A332296.
The strong version is A332337.
The co-strong version is (also) A332337.
Cf. A001462, A181819, A182850, A317081, A317245, A317491, A329744, A332276, A332289, A332292, A332295, A332297, A332336, A332340.

recnQ[ptn_]:=Or[ptn=={},Union[ptn]=={1},And[Union[ptn]==Range[Max[ptn]],recnQ[Length/@Split[ptn]]]];
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],recnQ]],{n,0,10}]

For n > 1, a(n) = A332296(n) - 1.

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[#]]]&]

A332295 Number of widely recursively normal integer partitions of n.

Original entry on oeis.org

1, 1, 2, 3, 4, 6, 6, 10, 12, 17, 21, 30, 34, 48, 54, 74, 86, 113, 132, 169, 200, 246, 293, 360, 422, 512, 599, 726, 840, 1009, 1181, 1401, 1631, 1940, 2240, 2636, 3069, 3567, 4141, 4846, 5556, 6470, 7505, 8627, 9936, 11523, 13176, 15151, 17430, 19935, 22846

Offset: 0

Gus Wiseman, Feb 16 2020

nonn

A sequence is widely recursively normal if either it is all 1's (wide) or its run-lengths cover an initial interval of positive integers (normal) and are themselves a widely recursively normal sequence.

			The a(1) = 1 through a(8) = 12 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (21)   (31)    (32)     (42)      (43)       (53)
             (111)  (211)   (41)     (51)      (52)       (62)
                    (1111)  (221)    (321)     (61)       (71)
                            (311)    (411)     (322)      (332)
                            (11111)  (111111)  (331)      (422)
                                               (421)      (431)
                                               (511)      (521)
                                               (3211)     (611)
                                               (1111111)  (3221)
                                                          (4211)
                                                          (11111111)
For example, starting with y = (4,3,2,2,1) and repeatedly taking run-lengths gives (4,3,2,2,1) -> (1,1,2,1) -> (2,1,1) -> (1,2) -> (1,1), all of which have normal run-lengths, so y is widely recursively normal. On the other hand, starting with y and repeatedly taking multiplicities gives (4,3,2,2,1) -> (2,1,1,1) -> (3,1), so y is not fully normal (A317491).
Starting with y = (5,4,3,3,2,2,2,1,1) and repeatedly taking run-lengths gives (5,4,3,3,2,2,2,1,1) -> (1,1,2,3,2) -> (2,1,1,1) -> (1,3), so y is not widely recursively normal. On the other hand, starting with y and repeatedly taking multiplicities gives (5,4,3,3,2,2,2,1,1) -> (3,2,2,1,1) -> (2,2,1) -> (2,1) -> (1,1), so y is fully normal (A317491).

The narrow version is A000012.
Partitions with normal multiplicities are A317081.
The Heinz numbers of these partitions are a proper superset of A317492.
Accepting any constant sequence instead of just 1's gives A332272.
The total (instead of recursive) version is A332277.
The case of reversed partitions is this same sequence.
The alternating (instead of recursive) version is this same sequence.
Dominated by A332576.
Cf. A000009, A001462, A181819, A182850, A317245, A317491, A329746, A329747, A332276.

recnQ[ptn_]:=Or[ptn=={},Union[ptn]=={1},And[Union[Length/@Split[ptn]]==Range[Max[Length/@Split[ptn]]],recnQ[Length/@Split[ptn]]]];
Table[Length[Select[IntegerPartitions[n],recnQ]],{n,0,30}]

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[#]]]&]

cp's OEIS Frontend

A332277 Number of widely totally normal integer partitions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A332291 Heinz numbers of widely totally strongly normal integer partitions.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A332337 Number of widely totally strongly normal compositions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A332296 Number of narrowly totally normal compositions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A332279 Number of widely totally normal compositions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A332295 Number of widely recursively normal integer partitions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica