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

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.
Cf. A000720, A001221, A001222, A047966, A048767, A351013, A351202, A381435, A382876, A383090, A383091, A383092, A383112.

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.

A367588 Number of integer partitions of n with exactly two distinct parts, both appearing with the same multiplicity.

Original entry on oeis.org

0, 0, 0, 1, 1, 2, 3, 3, 4, 5, 6, 5, 9, 6, 9, 10, 11, 8, 15, 9, 16, 14, 15, 11, 23, 14, 18, 18, 23, 14, 30, 15, 26, 22, 24, 22, 38, 18, 27, 26, 38, 20, 42, 21, 37, 36, 33, 23, 53, 27, 42, 34, 44, 26, 54, 34, 53, 38, 42, 29, 74, 30, 45, 49, 57, 40, 66, 33, 58, 46
Offset: 0

Views

Author

Gus Wiseman, Dec 01 2023

Keywords

Comments

The Heinz numbers of these partitions are given by A268390.

Examples

			The a(3) = 1 through a(12) = 9 partitions (A = 10, B = 11):
  (21)  (31)  (32)  (42)    (43)  (53)    (54)      (64)    (65)  (75)
              (41)  (51)    (52)  (62)    (63)      (73)    (74)  (84)
                    (2211)  (61)  (71)    (72)      (82)    (83)  (93)
                                  (3311)  (81)      (91)    (92)  (A2)
                                          (222111)  (3322)  (A1)  (B1)
                                                    (4411)        (4422)
                                                                  (5511)
                                                                  (333111)
                                                                  (22221111)

Links

Crossrefs

For any multiplicities we have A002133, ranks A007774.
For any number of distinct parts we have A047966, ranks A072774.
For distinct multiplicities we have A182473, ranks A367589.
These partitions have ranks A268390.
A000041 counts integer partitions, strict A000009.
A072233 counts partitions by number of parts.
A116608 counts partitions by number of distinct parts.
Cf. A023645, A091602, A116861, A181819, A243978, A367582.

Programs

  • Mathematica
    Table[Sum[Floor[(d-1)/2],{d,Divisors[n]}],{n,30}]

Formula

G.f.: Sum_{i, j>0} x^(j*(2*i+1))/(1-x^j). - John Tyler Rascoe, Feb 04 2024

A367590 Numbers with exactly two distinct prime factors, both appearing with the same exponent.

Original entry on oeis.org

6, 10, 14, 15, 21, 22, 26, 33, 34, 35, 36, 38, 39, 46, 51, 55, 57, 58, 62, 65, 69, 74, 77, 82, 85, 86, 87, 91, 93, 94, 95, 100, 106, 111, 115, 118, 119, 122, 123, 129, 133, 134, 141, 142, 143, 145, 146, 155, 158, 159, 161, 166, 177, 178, 183, 185, 187, 194
Offset: 1

Views

Author

Gus Wiseman, Dec 01 2023

Keywords

Comments

First differs from A268390 in lacking 210.
First differs from A238748 in lacking 210.
These are the Heinz numbers of the partitions counted by A367588.

Examples

			The terms together with their prime indices begin:
     6: {1,2}         57: {2,8}        106: {1,16}
    10: {1,3}         58: {1,10}       111: {2,12}
    14: {1,4}         62: {1,11}       115: {3,9}
    15: {2,3}         65: {3,6}        118: {1,17}
    21: {2,4}         69: {2,9}        119: {4,7}
    22: {1,5}         74: {1,12}       122: {1,18}
    26: {1,6}         77: {4,5}        123: {2,13}
    33: {2,5}         82: {1,13}       129: {2,14}
    34: {1,7}         85: {3,7}        133: {4,8}
    35: {3,4}         86: {1,14}       134: {1,19}
    36: {1,1,2,2}     87: {2,10}       141: {2,15}
    38: {1,8}         91: {4,6}        142: {1,20}
    39: {2,6}         93: {2,11}       143: {5,6}
    46: {1,9}         94: {1,15}       145: {3,10}
    51: {2,7}         95: {3,8}        146: {1,21}
    55: {3,5}        100: {1,1,3,3}    155: {3,11}

Links

Crossrefs

The case of any multiplicities is A007774, counts A002133.
Partitions of this type are counted by A367588.
The case of distinct exponents is A367589, counts A182473.
A000041 counts integer partitions, strict A000009.
A091602 counts partitions by greatest multiplicity, least A243978.
A116608 counts partitions by number of distinct parts.
Cf. A006881, A039956, A071625, A072233, A072774, A109297, A303661, A367580.

Programs

  • Mathematica
    Select[Range[100], SameQ@@Last/@If[#==1, {}, FactorInteger[#]]&&PrimeNu[#]==2&]
Select[Range[200],PrimeNu[#]==2&&Length[Union[FactorInteger[#][[;;,2]]]]==1&] (* Harvey P. Dale, Aug 04 2025 *)

Formula

Union of A006881 and A303661. - Michael De Vlieger, Dec 01 2023
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.