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 31-33 of 33 results.

A363484 Number of integer partitions of n covering an initial interval of positive integers with a unique mode.

Original entry on oeis.org

0, 1, 1, 1, 2, 3, 2, 5, 6, 6, 8, 11, 12, 17, 20, 21, 27, 35, 38, 50, 56, 65, 76, 95, 105, 125, 146, 167, 198, 233, 252, 305, 351, 394, 457, 522, 585, 681, 778, 878, 994, 1135, 1269, 1446, 1638, 1828, 2067, 2339, 2613, 2940, 3301, 3684, 4143, 4634, 5156, 5771
Offset: 0

Views

Author

Gus Wiseman, Jun 05 2023

Keywords

Comments

A mode in a multiset is an element that appears at least as many times as each of the others. For example, the modes of {a,a,b,b,b,c,d,d,d} are {b,d}.

Examples

			The a(1) = 1 through a(8) = 6 partitions:
  (1)  (11)  (111)  (211)   (221)    (21111)   (2221)     (3221)
                    (1111)  (2111)   (111111)  (3211)     (22211)
                            (11111)            (22111)    (32111)
                                               (211111)   (221111)
                                               (1111111)  (2111111)
                                                          (11111111)
		

Crossrefs

For parts instead of multiplicities we have A096765, complement A025147.
For multisets instead of partitions we have A097979, complement A363262.
For co-mode we have A363263, complement A363264.
The complement is counted by A363485.
A000041 counts integer partitions, A000009 covering an initial interval.
A362607 counts partitions with multiple modes, co-modes A362609.
A362608 counts partitions with a unique mode, co-mode A362610.
A362614 counts partitions by number of modes, co-modes A362615.

Programs

  • Mathematica
    Table[If[n==0,0,Length[Select[IntegerPartitions[n], Union[#]==Range[Max@@#]&&Length[Commonest[#]]==1&]]],{n,0,30}]

A363485 Number of integer partitions of n covering an initial interval of positive integers with more than one mode.

Original entry on oeis.org

0, 0, 0, 1, 0, 0, 2, 0, 0, 2, 2, 1, 3, 1, 2, 6, 5, 3, 8, 4, 8, 11, 13, 9, 17, 17, 19, 25, 24, 23, 44, 35, 39, 54, 55, 63, 83, 79, 86, 104, 119, 125, 157, 164, 178, 220, 237, 251, 297, 324, 357, 413, 439, 486, 562, 607, 673, 765, 828, 901, 1040, 1117, 1220
Offset: 0

Views

Author

Gus Wiseman, Jun 06 2023

Keywords

Comments

A mode in a multiset is an element that appears at least as many times as each of the others. For example, the modes of {a,a,b,b,b,c,d,d,d} are {b,d}.

Examples

			The a(n) partitions for n = {3, 6, 12, 15, 16, 18}:
  (21)  (321)   (332211)    (54321)       (443221)    (4433211)
        (2211)  (3222111)   (433221)      (3332221)   (5432211)
                (22221111)  (443211)      (4332211)   (43332111)
                            (33222111)    (33322111)  (333222111)
                            (322221111)   (43222111)  (333321111)
                            (2222211111)              (3322221111)
                                                      (32222211111)
                                                      (222222111111)
		

Crossrefs

For parts instead of multiplicities we have A025147, complement A096765.
For co-mode we have A363264, complement A363263.
The complement is counted by A363484.
A000041 counts integer partitions, A000009 covering an initial interval.
A071178 counts maxima in prime factorization, modes A362611.
A362607 counts partitions with multiple modes, co-modes A362609.
A362608 counts partitions with a unique mode, co-mode A362610.
A362614 counts partitions by number of modes, co-modes A362615.

Programs

  • Mathematica
    Table[If[n==0,0,Length[Select[IntegerPartitions[n], Union[#]==Range[Max@@#]&&Length[Commonest[#]]>1&]]],{n,0,30}]

A364193 Number of integer partitions of n where the least part is the unique mode.

Original entry on oeis.org

0, 1, 2, 2, 4, 4, 7, 9, 13, 17, 24, 32, 43, 58, 75, 97, 130, 167, 212, 274, 346, 438, 556, 695, 865, 1082, 1342, 1655, 2041, 2511, 3067, 3756, 4568, 5548, 6728, 8130, 9799, 11810, 14170, 16980, 20305, 24251, 28876, 34366, 40781, 48342, 57206, 67597, 79703
Offset: 0

Views

Author

Gus Wiseman, Jul 16 2023

Keywords

Comments

A mode in a multiset is an element that appears at least as many times as each of the others. For example, the modes in {a,a,b,b,b,c,d,d,d} are {b,d}.

Examples

			The a(1) = 1 through a(8) = 13 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (111)  (22)    (311)    (33)      (322)      (44)
                    (211)   (2111)   (222)     (511)      (422)
                    (1111)  (11111)  (411)     (3211)     (611)
                                     (3111)    (4111)     (2222)
                                     (21111)   (22111)    (4211)
                                     (111111)  (31111)    (5111)
                                               (211111)   (32111)
                                               (1111111)  (41111)
                                                          (221111)
                                                          (311111)
                                                          (2111111)
                                                          (11111111)
		

Crossrefs

For greatest part and multiple modes we have A171979.
Allowing multiple modes gives A240303.
For greatest instead of least part we have A362612, ranks A362616.
For mean instead of least part we have A363723.
These partitions have ranks A364160.
A000041 counts integer partitions.
A362611 counts modes in prime factorization, A362613 co-modes.
A362614 counts partitions by number of modes, co-modes A362615.
A363486 gives least mode in prime indices, A363487 greatest.
A363952 counts partitions by low mode, A363953 high.
Ranking and counting partitions:
- A356862 = unique mode, counted by A362608
- A359178 = unique co-mode, counted by A362610
- A362605 = multiple modes, counted by A362607
- A362606 = multiple co-modes, counted by A362609

Programs

  • Mathematica
    Table[If[n==0,0,Length[Select[IntegerPartitions[n], Last[Length/@Split[#]]>Max@@Most[Length/@Split[#]]&]]],{n,0,30}]
Previous Showing 31-33 of 33 results.