cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-7 of 7 results.

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

Views

Author

Gus Wiseman, Feb 14 2020

Keywords

Comments

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.

Examples

			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)
		

Crossrefs

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.

Programs

  • Mathematica
    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

Views

Author

Gus Wiseman, Feb 15 2020

Keywords

Comments

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.

Examples

			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).
		

Crossrefs

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.

Programs

  • Mathematica
    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}]

Formula

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

A332278 Number of widely totally co-strongly normal integer partitions of n.

Original entry on oeis.org

1, 1, 1, 2, 2, 1, 2, 1, 1, 2, 3, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2
Offset: 0

Views

Author

Gus Wiseman, Mar 05 2020

Keywords

Comments

A sequence of integers is widely totally co-strongly normal if either it is constant 1's (wide) or it covers an initial interval of positive integers (normal) with weakly increasing run-lengths (co-strong) which are themselves a widely totally co-strongly normal sequence.
Is this sequence bounded?

Examples

			The a(1) = 1 through a(20) = 2 partitions:
   1: (1)
   2: (11)
   3: (21),(111)
   4: (211),(1111)
   5: (11111)
   6: (321),(111111)
   7: (1111111)
   8: (11111111)
   9: (32211),(111111111)
  10: (4321),(322111),(1111111111)
  11: (11111111111)
  12: (111111111111)
  13: (1111111111111)
  14: (11111111111111)
  15: (54321),(111111111111111)
  16: (1111111111111111)
  17: (11111111111111111)
  18: (111111111111111111)
  19: (1111111111111111111)
  20: (4332221111),(11111111111111111111)
		

Crossrefs

Not requiring co-strength gives A332277.
The strong version is A332297(n) - 1 for n > 1.
The narrow version is a(n) - 1 for n > 1.
The alternating version is A332289.
The Heinz numbers of these partitions are A332293.
The case of compositions is A332337.

Programs

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

Extensions

a(71)-a(78) from Jinyuan Wang, Jun 26 2020

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

Views

Author

Gus Wiseman, Feb 14 2020

Keywords

Comments

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.

Examples

			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.
		

Crossrefs

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.

Programs

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

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

Views

Author

Gus Wiseman, Jul 29 2018

Keywords

Comments

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.

Examples

			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.
		

Crossrefs

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.

Programs

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

Extensions

Updated with corrected terminology by Gus Wiseman, Mar 08 2020

A335376 Heinz numbers of totally 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, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71
Offset: 1

Views

Author

Gus Wiseman, Jun 04 2020

Keywords

Comments

First differs from A242031 and A317257 in lacking 60.
A sequence is totally co-strong if it is empty, equal to (1), or its run-lengths are weakly increasing (co-strong) and are themselves a totally co-strong sequence.
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.

Examples

			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}
For example, 180 is the Heinz number of (3,2,2,1,1) which has run-lengths: (1,2,2) -> (1,2) -> (1,1) -> (2) -> (1). All of these are weakly increasing, so 180 is in the sequence.
		

Crossrefs

Partitions with weakly increasing run-lengths are A100883.
Totally strong partitions are counted by A316496.
The strong version is A316529.
The version for reversed partitions is (also) A316529.
These partitions are counted by A332275.
The widely normal version is A332293.
The complement is A335377.

Programs

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

A335377 Heinz numbers of non-totally co-strong integer partitions.

Original entry on oeis.org

18, 50, 54, 60, 75, 84, 90, 98, 108, 120, 126, 132, 140, 147, 150, 156, 162, 168, 198, 204, 220, 228, 234, 240, 242, 245, 250, 260, 264, 270, 276, 280, 294, 300, 306, 308, 312, 315, 324, 336, 338, 340, 342, 348, 350, 363, 364, 372, 375, 378, 380, 408, 414, 420
Offset: 1

Views

Author

Gus Wiseman, Jun 05 2020

Keywords

Comments

A sequence is totally co-strong if it is empty, equal to (1), or its run-lengths are weakly increasing (co-strong) and are themselves a totally co-strong sequence.
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.

Examples

			The sequence of terms together with their prime indices begins:
   18: {1,2,2}        156: {1,1,2,6}        276: {1,1,2,9}
   50: {1,3,3}        162: {1,2,2,2,2}      280: {1,1,1,3,4}
   54: {1,2,2,2}      168: {1,1,1,2,4}      294: {1,2,4,4}
   60: {1,1,2,3}      198: {1,2,2,5}        300: {1,1,2,3,3}
   75: {2,3,3}        204: {1,1,2,7}        306: {1,2,2,7}
   84: {1,1,2,4}      220: {1,1,3,5}        308: {1,1,4,5}
   90: {1,2,2,3}      228: {1,1,2,8}        312: {1,1,1,2,6}
   98: {1,4,4}        234: {1,2,2,6}        315: {2,2,3,4}
  108: {1,1,2,2,2}    240: {1,1,1,1,2,3}    324: {1,1,2,2,2,2}
  120: {1,1,1,2,3}    242: {1,5,5}          336: {1,1,1,1,2,4}
  126: {1,2,2,4}      245: {3,4,4}          338: {1,6,6}
  132: {1,1,2,5}      250: {1,3,3,3}        340: {1,1,3,7}
  140: {1,1,3,4}      260: {1,1,3,6}        342: {1,2,2,8}
  147: {2,4,4}        264: {1,1,1,2,5}      348: {1,1,2,10}
  150: {1,2,3,3}      270: {1,2,2,2,3}      350: {1,3,3,4}
For example, 60 is the Heinz number of (3,2,1,1), which has run-lengths: (1,1,2) -> (2,1) -> (1,1) -> (2) -> (1). Since (2,1) is not weakly increasing, 60 is in the sequence.
		

Crossrefs

Partitions with weakly increasing run-lengths are counted by A100883.
Totally strong partitions are counted by A316496.
Heinz numbers of totally strong partitions are A316529.
The version for reversed partitions is A316597.
The strong version is (also) A316597.
The alternating version is A317258.
Totally co-strong partitions are counted by A332275.
The complement is A335376.

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    totcostrQ[q_]:=Or[Length[q]<=1,And[OrderedQ[Length/@Split[q]],totcostrQ[Length/@Split[q]]]];
    Select[Range[100],!totcostrQ[Reverse[primeMS[#]]]&]
Showing 1-7 of 7 results.