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.

Previous Showing 11-14 of 14 results.

A371132 Number of integer partitions of n with fewer distinct parts than distinct divisors of parts.

Original entry on oeis.org

0, 0, 1, 1, 2, 3, 5, 6, 10, 14, 21, 28, 40, 53, 73, 96, 130, 170, 223, 288, 375, 480, 616, 780, 990, 1245, 1567, 1954, 2440, 3024, 3745, 4610, 5674, 6947, 8499, 10349, 12591, 15258, 18468, 22277, 26841, 32238, 38673, 46262, 55278, 65881, 78423, 93136, 110477
Offset: 0

Views

Author

Gus Wiseman, Mar 17 2024

Keywords

Comments

The Heinz numbers of these partitions are given by A371179.

Examples

			The partition (4,3,1,1) has 3 distinct parts {1,3,4} and 4 distinct divisors of parts {1,2,3,4}, so is counted under a(9).
The a(0) = 0 through a(9) = 14 partitions:
  .  .  (2)  (3)  (4)   (5)   (6)    (7)     (8)      (9)
                  (22)  (32)  (33)   (43)    (44)     (54)
                        (41)  (42)   (52)    (53)     (63)
                              (222)  (61)    (62)     (72)
                              (411)  (322)   (332)    (81)
                                     (4111)  (422)    (333)
                                             (431)    (432)
                                             (611)    (441)
                                             (2222)   (522)
                                             (41111)  (621)
                                                      (3222)
                                                      (4311)
                                                      (6111)
                                                      (411111)

Crossrefs

The LHS is represented by A001221, distinct case of A001222.
The RHS is represented by A370820, for prime factors A303975.
The complement counting all parts on the LHS is A371172, ranks A371165.
Counting all parts on the LHS gives A371173, ranks A371168.
The complement is counted by A371178, ranks A371177.
These partitions are ranked by A371179.
The strict case is A371180, complement A371128.
A000005 counts divisors.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by length.
Cf. A003963, A239312, A319055, A355740, A370802, A370803, A370808, A370813, A371130, A371171.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],Length[Union[#]] < Length[Union@@Divisors/@#]&]],{n,0,30}]

A371167 Positive integers with more divisors (A000005) than distinct divisors of prime indices (A370820).

Original entry on oeis.org

1, 2, 4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22, 24, 25, 27, 28, 30, 32, 33, 34, 36, 40, 42, 44, 45, 46, 48, 50, 51, 52, 54, 55, 56, 60, 62, 63, 64, 66, 68, 70, 72, 75, 76, 78, 80, 81, 82, 84, 85, 88, 90, 92, 93, 96, 98, 99, 100, 102, 104, 105, 108, 110
Offset: 1

Views

Author

Gus Wiseman, Mar 14 2024

Keywords

Comments

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 814 are {1,5,12}, and there are 8 divisors (1,2,11,22,37,74,407,814) and 7 distinct divisors of prime indices (1,2,3,4,5,6,12), so 814 is in the sequence.
The prime indices of 1859 are {5,6,6}, and there are 6 divisors (1,11,13,143,169,1859) and 5 distinct divisors of prime indices (1,2,3,5,6), so 1859 is in the sequence.
The terms together with their prime indices begin:
     1: {}
     2: {1}
     4: {1,1}
     6: {1,2}
     8: {1,1,1}
     9: {2,2}
    10: {1,3}
    12: {1,1,2}
    14: {1,4}
    15: {2,3}
    16: {1,1,1,1}
    18: {1,2,2}
    20: {1,1,3}
    21: {2,4}
    22: {1,5}
    24: {1,1,1,2}
    25: {3,3}
    27: {2,2,2}
    28: {1,1,4}
    30: {1,2,3}

Crossrefs

For prime factors on the LHS we have A370348, counted by A371171.
The RHS is A370820, for prime factors instead of divisors A303975.
For (equal to) instead of (greater than) we get A371165, counted by A371172.
For (less than) instead of (greater than) we get A371166.
Other equalities: A319899, A370802 (A371130), A371128, A371177 (A371178).
Other inequalities: A371168 (A371173), A371169, A371170.
A000005 counts divisors.
A001221 counts distinct prime factors.
A027746 lists prime factors, A112798 indices, length A001222.
A239312 counts divisor-choosable partitions, ranks A368110.
A355731 counts choices of a divisor of each prime index, firsts A355732.
A370320 counts non-divisor-choosable partitions, ranks A355740.
A370814 counts divisor-choosable factorizations, complement A370813.
Cf. A000792, A003963, A355529, A355739, A355741, A368100, A370808, A371127.

Programs

  • Mathematica
    Select[Range[100],Length[Divisors[#]]>Length[Union @@ Divisors/@PrimePi/@First/@If[#==1,{},FactorInteger[#]]]&]

Formula

A000005(a(n)) > A370820(a(n)).

A371179 Positive integers with fewer distinct prime factors (A001221) than distinct divisors of prime indices (A370820).

Original entry on oeis.org

3, 5, 7, 9, 11, 13, 14, 15, 17, 19, 21, 23, 25, 26, 27, 28, 29, 31, 33, 35, 37, 38, 39, 41, 43, 45, 46, 47, 49, 51, 52, 53, 55, 56, 57, 58, 59, 61, 63, 65, 67, 69, 70, 71, 73, 74, 75, 76, 77, 78, 79, 81, 83, 85, 86, 87, 89, 91, 92, 93, 94, 95, 97, 98, 99, 101
Offset: 1

Views

Author

Gus Wiseman, Mar 19 2024

Keywords

Comments

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 terms together with their prime indices begin:
     3: {2}        28: {1,1,4}    52: {1,1,6}      74: {1,12}
     5: {3}        29: {10}       53: {16}         75: {2,3,3}
     7: {4}        31: {11}       55: {3,5}        76: {1,1,8}
     9: {2,2}      33: {2,5}      56: {1,1,1,4}    77: {4,5}
    11: {5}        35: {3,4}      57: {2,8}        78: {1,2,6}
    13: {6}        37: {12}       58: {1,10}       79: {22}
    14: {1,4}      38: {1,8}      59: {17}         81: {2,2,2,2}
    15: {2,3}      39: {2,6}      61: {18}         83: {23}
    17: {7}        41: {13}       63: {2,2,4}      85: {3,7}
    19: {8}        43: {14}       65: {3,6}        86: {1,14}
    21: {2,4}      45: {2,2,3}    67: {19}         87: {2,10}
    23: {9}        46: {1,9}      69: {2,9}        89: {24}
    25: {3,3}      47: {15}       70: {1,3,4}      91: {4,6}
    26: {1,6}      49: {4,4}      71: {20}         92: {1,1,9}
    27: {2,2,2}    51: {2,7}      73: {21}         93: {2,11}

Crossrefs

The LHS is A001221, distinct case of A001222.
The RHS is A370820, for prime factors A303975.
Partitions of this type are counted by A371132, strict A371180.
Counting all prime indices on the LHS gives A371168, counted by A371173.
The complement is A371177, counted by A371178, strict A371128.
A000005 counts divisors.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by length.
A305148 counts pairwise indivisible (stable) partitions, ranks A316476.
Cf. A003963, A239312, A285573, A355529, A370802, A370803, A371130, A371165, A371171, A371172.

Programs

  • Mathematica
    Select[Range[100],PrimeNu[#]

Formula

A001221(a(n)) < A370820(a(n)).

A371180 Number of strict integer partitions of n with fewer parts than distinct divisors of parts.

Original entry on oeis.org

0, 0, 1, 1, 1, 3, 2, 4, 4, 7, 8, 10, 12, 15, 19, 22, 29, 33, 40, 47, 57, 68, 81, 95, 110, 129, 152, 178, 207, 240, 277, 317, 365, 422, 486, 558, 632, 723, 824, 940, 1067, 1210, 1371, 1544, 1751, 1977, 2233, 2508, 2820, 3162, 3555, 3983, 4465, 4990, 5571, 6224
Offset: 0

Views

Author

Gus Wiseman, Mar 18 2024

Keywords

Examples

			The strict partition (6,4,2,1) has 4 parts and 5 distinct divisors of parts {1,2,3,4,5}, so is counted under a(13).
The a(2) = 1 through a(11) = 10 partitions:
  (2)  (3)  (4)  (5)    (6)    (7)    (8)      (9)      (10)     (11)
                 (3,2)  (4,2)  (4,3)  (5,3)    (5,4)    (6,4)    (6,5)
                 (4,1)         (5,2)  (6,2)    (6,3)    (7,3)    (7,4)
                               (6,1)  (4,3,1)  (7,2)    (8,2)    (8,3)
                                               (8,1)    (9,1)    (9,2)
                                               (4,3,2)  (5,3,2)  (10,1)
                                               (6,2,1)  (5,4,1)  (5,4,2)
                                                        (6,3,1)  (6,3,2)
                                                                 (6,4,1)
                                                                 (8,2,1)

Crossrefs

The LHS is represented by A001221, distinct case of A001222.
The RHS is represented by A370820, for prime factors A303975.
The version for equality is A371128.
The non-strict version is A371132, ranks A371179.
The non-strict complement is A371178, ranks A371177.
A000005 counts divisors.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by length.
Cf. A003963, A239312, A319055, A355529, A370803, A370808, A370813, A371130 (A370802), A371171, A371172 (A371165), A371173 (A371168).

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&Length[Union[#]] < Length[Union@@Divisors/@#]&]],{n,0,30}]
Previous Showing 11-14 of 14 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.