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-4 of 4 results.

A383094 Number of integer partitions of n having exactly one permutation with all equal run-lengths.

Original entry on oeis.org

1, 1, 2, 2, 4, 4, 5, 6, 9, 7, 11, 10, 13, 12, 17, 14, 21, 16, 21, 18, 27, 22, 29, 22, 34, 25, 35, 28, 41, 28, 43, 30, 48, 38, 47, 38, 55, 36, 53, 46, 64, 40, 67, 42, 69, 54, 65, 46, 84, 51, 75, 62, 83, 52, 86, 62, 94, 70, 83, 58, 111, 60, 89, 80, 106, 74, 115, 66, 111
Offset: 0

Views

Author

Gus Wiseman, Apr 20 2025

Keywords

Examples

			The partition (222211) has exactly one permutation with all equal run-lengths: (221122), so is counted under a(10).
The a(1) = 1 through a(8) = 9 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (111)  (22)    (221)    (33)      (322)      (44)
                    (211)   (311)    (222)     (331)      (332)
                    (1111)  (11111)  (411)     (511)      (422)
                                     (111111)  (22111)    (611)
                                               (1111111)  (2222)
                                                          (22211)
                                                          (221111)
                                                          (11111111)
		

Crossrefs

The complement is ranked by A382879 \/ A383089.
For no choices we have A382915, ranks A382879.
For at least one choice we have A383013, for run-sums A383098, ranks A383110.
For more than one choice we have A383090, ranks A383089.
For at most one choice we have A383092, ranks A383091.
For run-sums instead of lengths we have A383095, ranks A383099.
Partitions of this type are ranked by A383112 = positions of 1 in A382857.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by length, strict A008289.
A239455 counts Look-and-Say partitions, ranks A351294, conjugate A381432.
A329738 counts compositions with equal run-lengths, ranks A353744.
A329739 counts compositions with distinct run-lengths, ranks A351596, complement A351291.
A351293 counts non-Look-and-Say partitions, ranks A351295, conjugate A381433.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n], Length[Select[Permutations[#], SameQ@@Length/@Split[#]&]]==1&]],{n,0,20}]

Extensions

More terms from Bert Dobbelaere, Apr 26 2025

A383090 Number of integer partitions of n having more than one permutation with all equal run-lengths.

Original entry on oeis.org

0, 0, 0, 1, 1, 2, 4, 5, 9, 14, 20, 28, 43, 55, 77, 107, 141, 183, 244, 312, 411, 521, 664, 837, 1069, 1328, 1667, 2069, 2578, 3166, 3929, 4791, 5895, 7168, 8749, 10594, 12883, 15500, 18741, 22493, 27069, 32334, 38760, 46133, 55065, 65367, 77686, 91905, 108927, 128431, 151674
Offset: 0

Views

Author

Gus Wiseman, Apr 19 2025

Keywords

Examples

			The partition (3322221) has 3 permutations with all equal run-lengths: (2323212), (2321232), (2123232), so is counted under a(15).
The partition (3322111111) has 2 permutations with all equal run-lengths: (1133112211), (1122113311), so is counted under a(16).
The a(3) = 1 through a(9) = 14 partitions:
  (21)  (31)  (32)  (42)    (43)    (53)     (54)
              (41)  (51)    (52)    (62)     (63)
                    (321)   (61)    (71)     (72)
                    (2211)  (421)   (431)    (81)
                            (3211)  (521)    (432)
                                    (3221)   (531)
                                    (3311)   (621)
                                    (4211)   (3321)
                                    (32111)  (4221)
                                             (4311)
                                             (5211)
                                             (32211)
                                             (42111)
                                             (222111)
		

Crossrefs

For no choices we have A382915, ranks A382879.
For at least one choice we have A383013, for run-sums A383098, ranks A383110.
Partitions of this type are ranked by A383089 = positions of terms > 1 in A382857.
The complement is A383091, counted by A383092.
For a unique choice we have A383094, ranks A383112.
The complement for run-sums is A383095 + A383096, ranks A383099 \/ A383100.
For run-sums we have A383097, ranked by A383015 = positions of terms > 1 in A382877.
For distinct instead of equal run-lengths we have A383111, ranks A383113.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by length, strict A008289.
A239455 counts Look-and-Say partitions, ranks A351294, conjugate A381432.
A329738 counts compositions with equal run-lengths, ranks A353744.
A351293 counts non-Look-and-Say partitions, ranks A351295, conjugate A381433.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n], Length[Select[Permutations[#], SameQ@@Length/@Split[#]&]]>1&]],{n,0,15}]

Formula

The complement is counted by A383094 + A382915, ranks A383112 \/ A382879.

Extensions

More terms from Bert Dobbelaere, Apr 26 2025

A383092 Number of integer partitions of n having at most one permutation with all equal run-lengths.

Original entry on oeis.org

1, 1, 2, 2, 4, 5, 7, 10, 13, 16, 22, 28, 34, 46, 58, 69, 90, 114, 141, 178, 216, 271, 338, 418, 506, 630, 769, 941, 1140, 1399, 1675, 2051, 2454, 2975, 3561, 4289, 5094, 6137, 7274, 8692, 10269, 12249, 14414, 17128, 20110, 23767, 27872, 32849, 38346, 45094, 52552, 61533
Offset: 0

Views

Author

Gus Wiseman, Apr 19 2025

Keywords

Examples

			The partition (222211) has 1 permutation with all equal run-lengths: (221122), so is counted under a(10).
The partition (33211111) has no permutation with all equal run-lengths, so is counted under a(13).
The a(1) = 1 through a(7) = 10 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)
       (11)  (111)  (22)    (221)    (33)      (322)
                    (211)   (311)    (222)     (331)
                    (1111)  (2111)   (411)     (511)
                            (11111)  (3111)    (2221)
                                     (21111)   (4111)
                                     (111111)  (22111)
                                               (31111)
                                               (211111)
                                               (1111111)
		

Crossrefs

For no choices we have A382915, ranks A382879.
For at least one choice we have A383013, for run-sums A383098, ranks A383110.
The complement is A383090, ranks A383089.
Partitions of this type are ranked by A383091 = positions of terms <= 1 in A382857.
For a unique choice we have A383094, ranks A383112.
For run-sums instead of lengths we have A383095 + A383096, ranks A383099 \/ A383100.
The complement for run-sums is A383097, ranks A383015, positions of terms > 1 in A382877.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by length, strict A008289.
A239455 counts Look-and-Say partitions, ranks A351294, conjugate A381432.
A329738 counts compositions with equal run-lengths, ranks A353744.
A329739 counts compositions with distinct run-lengths, ranks A351596, complement A351291.
A351293 counts non-Look-and-Say partitions, ranks A351295, conjugate A381433.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],Length[Select[Permutations[#],SameQ@@Length/@Split[#]&]]<=1&]],{n,0,15}]

Formula

a(n) = A382915(n) + A383094(n).

Extensions

More terms from Bert Dobbelaere, Apr 26 2025

A383113 Numbers whose prime indices have more than one permutation with all distinct run-lengths.

Original entry on oeis.org

12, 18, 20, 24, 28, 40, 44, 45, 48, 50, 52, 54, 56, 63, 68, 72, 75, 76, 80, 88, 92, 96, 98, 99, 104, 108, 112, 116, 117, 124, 135, 136, 144, 147, 148, 152, 153, 160, 162, 164, 171, 172, 175, 176, 184, 188, 189, 192, 200, 207, 208, 212, 216, 224, 232, 236, 242
Offset: 1

Views

Author

Gus Wiseman, Apr 20 2025

Keywords

Comments

First differs from A177425, A182854, A367589 in having 216.
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.

Examples

			The prime indices of 360 are {1,1,1,2,2,3}, with six permutations with all distinct run-lengths:
  (1,1,1,2,2,3)
  (1,1,1,3,2,2)
  (2,2,1,1,1,3)
  (2,2,3,1,1,1)
  (3,1,1,1,2,2)
  (3,2,2,1,1,1)
so 360 is in the sequence.
The terms together with their prime indices begin:
  12: {1,1,2}
  18: {1,2,2}
  20: {1,1,3}
  24: {1,1,1,2}
  28: {1,1,4}
  40: {1,1,1,3}
  44: {1,1,5}
  45: {2,2,3}
  48: {1,1,1,1,2}
  50: {1,3,3}
  52: {1,1,6}
  54: {1,2,2,2}
  56: {1,1,1,4}
  63: {2,2,4}
  68: {1,1,7}
  72: {1,1,1,2,2}
  75: {2,3,3}
  76: {1,1,8}
  80: {1,1,1,1,3}
		

Crossrefs

For exactly one permutation we have A000961, counted by A000005.
For no choices we have A351293, counted by A351295, conjugate A381433, equal A382879.
For at least one choice we have A351294, conjugate A381432, counted by A239455.
These are positions of terms > 1 in A382771, firsts A382772, equal A382878.
For equal run-lengths we have A383089, positions of terms > 1 in A382857.
Partitions of this type are counted by A383111.
A044813 lists numbers whose binary expansion has distinct run-lengths.
A056239 adds up prime indices, row sums of A112798.
A098859 counts partitions with distinct run-lengths (ordered A242882), ranks A130091.
A329739 counts compositions with distinct run-lengths, ranks A351596, complement A351291.

Programs

  • Mathematica
    Select[Range[100], Length[Select[Permutations[PrimePi/@Join @@ ConstantArray@@@FactorInteger[#]], UnsameQ@@Length/@Split[#]&]]>1&]

Formula

The complement is A000961 \/ A351293, counted by A000005 + A351295.
Showing 1-4 of 4 results.