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

A363727 Numbers whose prime indices satisfy (mean) = (median) = (mode), assuming there is a unique mode.

Original entry on oeis.org

2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23, 25, 27, 29, 31, 32, 37, 41, 43, 47, 49, 53, 59, 61, 64, 67, 71, 73, 79, 81, 83, 89, 90, 97, 101, 103, 107, 109, 113, 121, 125, 127, 128, 131, 137, 139, 149, 151, 157, 163, 167, 169, 173, 179, 181, 191, 193, 197, 199
Offset: 1

Views

Author

Gus Wiseman, Jun 23 2023

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.
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}.
The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).

Examples

			The terms together with their prime indices begin:
     2: {1}          29: {10}              79: {22}
     3: {2}          31: {11}              81: {2,2,2,2}
     4: {1,1}        32: {1,1,1,1,1}       83: {23}
     5: {3}          37: {12}              89: {24}
     7: {4}          41: {13}              90: {1,2,2,3}
     8: {1,1,1}      43: {14}              97: {25}
     9: {2,2}        47: {15}             101: {26}
    11: {5}          49: {4,4}            103: {27}
    13: {6}          53: {16}             107: {28}
    16: {1,1,1,1}    59: {17}             109: {29}
    17: {7}          61: {18}             113: {30}
    19: {8}          64: {1,1,1,1,1,1}    121: {5,5}
    23: {9}          67: {19}             125: {3,3,3}
    25: {3,3}        71: {20}             127: {31}
    27: {2,2,2}      73: {21}             128: {1,1,1,1,1,1,1}

Crossrefs

These partitions are counted by A363719, factorizations A363741.
For unequal instead of equal we have A363730, counted by A363720.
Excluding primes gives A363722.
Excluding prime-powers gives A363729, counted by A363728.
A112798 lists prime indices, length A001222, sum A056239.
A326567/A326568 gives mean of prime indices.
A356862 ranks partitions with a unique mode, counted by A362608.
A359178 ranks partitions with multiple modes, counted by A362610.
A360005 gives twice the median of prime indices.
A362611 counts modes in prime indices, triangle A362614.
A362613 counts co-modes in prime indices, triangle A362615.
A363486 gives least mode in prime indices, A363487 greatest.
Just two statistics:
- (mean) = (median): A359889, counted by A240219.
- (mean) != (median): A359890, counted by A359894.
- (mean) = (mode): counted by A363723, see A363724, A363731.
- (median) = (mode): counted by A363740.
Cf. A215366, A327473, A327476, A359893, A359908, A360009, A360248, A360550, A363721, A363725.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
Select[Range[100],{Mean[prix[#]]}=={Median[prix[#]]}==modes[prix[#]]&]

Formula

Assuming there is a unique mode, we have A326567(a(n))/A326568(a(n)) = A360005(a(n))/2 = A363486(a(n)) = A363487(a(n)).

A363724 Number of integer partitions of n whose mean is a mode, i.e., partitions whose mean appears at least as many times as each of the other parts.

Original entry on oeis.org

1, 2, 2, 3, 2, 5, 2, 5, 5, 6, 2, 15, 2, 8, 15, 17, 2, 30, 2, 43, 30, 15, 2, 112, 36, 21, 60, 119, 2, 251, 2, 201, 126, 41, 271, 655, 2, 57, 250, 1060, 2, 1099, 2, 844, 1508, 107, 2, 3484, 802, 2068, 900, 2136, 2, 4558, 3513, 7071, 1630, 259, 2, 20260
Offset: 1

Views

Author

Gus Wiseman, Jun 24 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(n) partitions for n = 6, 10, 12:
  (6)            (10)                   (12)
  (3,3)          (5,5)                  (6,6)
  (2,2,2)        (2,2,2,2,2)            (4,4,4)
  (3,2,1)        (3,2,2,2,1)            (5,4,3)
  (1,1,1,1,1,1)  (4,2,2,1,1)            (6,4,2)
                 (1,1,1,1,1,1,1,1,1,1)  (7,4,1)
                                        (3,3,3,3)
                                        (4,3,3,2)
                                        (5,3,3,1)
                                        (6,3,2,1)
                                        (2,2,2,2,2,2)
                                        (3,2,2,2,2,1)
                                        (3,3,2,2,1,1)
                                        (4,2,2,2,1,1)
                                        (1,1,1,1,1,1,1,1,1,1,1,1)

Crossrefs

For parts instead of modes we have A237984, complement A327472.
The case of a unique mode is A363723, non-constant A362562.
The case of more than one mode is A363731.
A000041 counts partitions, strict A000009.
A008284 counts partitions by length (or decreasing mean), strict A008289.
A362608 counts partitions with a unique mode.
A363719 = all three averages equal, ranks A363727, non-constant A363728.
A363720 = all three averages different, ranks A363730, unique mode A363725.
Cf. A240219, A326567/A326568, A363726, A363740.

Programs

  • Mathematica
    modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
Table[Length[Select[IntegerPartitions[n],MemberQ[modes[#],Mean[#]]&]],{n,30}]

A363719 Number of integer partitions of n satisfying (mean) = (median) = (mode), assuming there is a unique mode.

Original entry on oeis.org

1, 2, 2, 3, 2, 4, 2, 5, 3, 5, 2, 10, 2, 7, 7, 12, 2, 18, 2, 24, 16, 13, 2, 58, 15, 18, 37, 60, 2, 123, 2, 98, 79, 35, 103, 332, 2, 49, 166, 451, 2, 515, 2, 473, 738, 92, 2, 1561, 277, 839, 631, 1234, 2, 2043, 1560, 2867, 1156, 225, 2, 9020
Offset: 1

Views

Author

Gus Wiseman, Jun 19 2023

Keywords

Comments

The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).
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}.
Without loss of generality, we may assume there is a unique middle-part (A238478).
Includes all constant partitions.

Examples

			The a(n) partitions for n = 1, 2, 4, 6, 8, 12, 14, 16 (A..G = 10..16):
  1  2   4     6       8         C             E               G
     11  22    33      44        66            77              88
         1111  222     2222      444           2222222         4444
               111111  3221      3333          3222221         5443
                       11111111  4332          3322211         6442
                                 5331          4222211         7441
                                 222222        11111111111111  22222222
                                 322221                        32222221
                                 422211                        33222211
                                 111111111111                  42222211
                                                               52222111
                                                               1^16

Crossrefs

For unequal instead of equal: A363720, ranks A363730, unique mode A363725.
The odd-length case is A363721.
These partitions have ranks A363727, nonprime A363722.
The case of non-constant partitions is A363728, ranks A363729.
The version for factorizations is A363741, see A359909, A359910.
Just two statistics:
- (mean) = (median) gives A240219, also A359889, A359895, A359897, A359899.
- (mean) != (median) gives A359894, also A359890, A359896, A359898, A359900.
- (mean) = (mode) gives A363723, see A363724, A363731.
- (median) = (mode) gives A363740.
A000041 counts partitions, strict A000009.
A008284 counts partitions by length (or negative mean), strict A008289.
A359893 and A359901 count partitions by median, odd-length A359902.
A362608 counts partitions with a unique mode.
Cf. A027193, A237984, A325347, A326567/A326568, A327472, A363726, A363742.

Programs

  • Mathematica
    modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
Table[Length[Select[IntegerPartitions[n], {Mean[#]}=={Median[#]}==modes[#]&]],{n,30}]

A363720 Number of integer partitions of n with different mean, median, and mode.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 2, 3, 5, 7, 16, 17, 34, 38, 50, 79, 115, 123, 198, 220, 291, 399, 536, 605, 815, 1036, 1241, 1520, 2059, 2315, 3132, 3708, 4491, 5668, 6587, 7788, 10259, 12299, 14515, 17153, 21558, 24623, 30876, 35540, 41476, 52023, 61931, 70811, 85545
Offset: 0

Views

Author

Gus Wiseman, Jun 21 2023

Keywords

Comments

If there are multiple modes, then the mode is automatically considered different from the mean and median; otherwise, we take the unique mode.
The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).
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(7) = 2 through a(11) = 16 partitions:
  (421)   (431)   (621)    (532)     (542)
  (3211)  (521)   (3321)   (541)     (632)
          (4211)  (4311)   (631)     (641)
                  (5211)   (721)     (731)
                  (32211)  (5311)    (821)
                           (6211)    (4322)
                           (322111)  (4421)
                                     (5321)
                                     (5411)
                                     (6311)
                                     (7211)
                                     (33221)
                                     (43211)
                                     (52211)
                                     (332111)
                                     (422111)

Crossrefs

For equal instead of unequal: A363719, ranks A363727, odd-length A363721.
The case of a unique mode is A363725.
These partitions have ranks A363730.
For factorizations we have A363742, for equal A363741, see A359909, A359910.
Just two statistics:
- (mean) = (median) gives A240219, also A359889, A359895, A359897, A359899.
- (mean) != (median) gives A359894, also A359890, A359896, A359898, A359900.
- (mean) = (mode) gives A363723, see A363724, A363731.
- (median) = (mode) gives A363740.
A000041 counts partitions, strict A000009.
A008284 counts partitions by length (or negative mean), strict A008289.
A359893 and A359901 count partitions by median, odd-length A359902.
A362608 counts partitions with a unique mode.
Cf. A027193, A237984, A325347, A326567/A326568, A327472, A363726, A363728.

Programs

  • Mathematica
    modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
Table[Length[Select[IntegerPartitions[n],{Mean[#]}!={Median[#]}!=modes[#]&]],{n,0,30}]

A363725 Number of integer partitions of n with a different mean, median, and mode, assuming there is a unique mode.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 1, 3, 3, 8, 8, 17, 19, 28, 39, 59, 68, 106, 123, 165, 220, 301, 361, 477, 605, 745, 929, 1245, 1456, 1932, 2328, 2846, 3590, 4292, 5111, 6665, 8040, 9607, 11532, 14410, 16699, 20894, 24287, 28706, 35745, 42845, 49548, 59963, 70985
Offset: 0

Views

Author

Gus Wiseman, Jun 22 2023

Keywords

Comments

The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).
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(7) = 1 through a(13) = 17 partitions:
  (3211)  (4211)  (3321)  (5311)    (4322)    (4431)    (4432)
                  (4311)  (6211)    (4421)    (5322)    (5422)
                  (5211)  (322111)  (5411)    (6411)    (5521)
                                    (6311)    (7311)    (6322)
                                    (7211)    (8211)    (6511)
                                    (43211)   (53211)   (7411)
                                    (332111)  (432111)  (8311)
                                    (422111)  (522111)  (9211)
                                                        (54211)
                                                        (63211)
                                                        (333211)
                                                        (433111)
                                                        (442111)
                                                        (532111)
                                                        (622111)
                                                        (3322111)
                                                        (32221111)

Crossrefs

The length-4 case appears to be A325695.
For equal instead of unequal we have A363719, ranks A363727.
Allowing multiple modes gives A363720, ranks A363730.
A000041 counts partitions, strict A000009.
A008284 counts partitions by length (or decreasing mean), strict A008289.
A359893 and A359901 count partitions by median, odd-length A359902.
A362608 counts partitions with a unique mode.
Cf. A237984, A240219, A325347, A326567/A326568, A327472, A359894, A359896, A359900, A363723, A363728.

Programs

  • Mathematica
    modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
Table[Length[Select[IntegerPartitions[n], Length[modes[#]]==1&&Mean[#]!=Median[#]!=First[modes[#]]&]],{n,0,30}]

A363729 Numbers that are not a power of a prime but whose prime indices satisfy (mean) = (median) = (mode), assuming there is a unique mode.

Original entry on oeis.org

90, 270, 525, 550, 756, 810, 1666, 1911, 1950, 2268, 2430, 2625, 2695, 2700, 2750, 5566, 6762, 6804, 6897, 7128, 7290, 8100, 8500, 9310, 9750, 10285, 10478, 11011, 11550, 11662, 12250, 12375, 12495, 13125, 13377, 13750, 14014, 14703, 18865, 19435, 20412, 21384
Offset: 1

Views

Author

Gus Wiseman, Jun 24 2023

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.
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}.
The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).

Examples

			The prime indices of 6897 are {2,5,5,8}, with mean 5, median 5, and modes {5}, so 6897 is in the sequence.
The terms together with their prime indices begin:
     90: {1,2,2,3}
    270: {1,2,2,2,3}
    525: {2,3,3,4}
    550: {1,3,3,5}
    756: {1,1,2,2,2,4}
    810: {1,2,2,2,2,3}
   1666: {1,4,4,7}
   1911: {2,4,4,6}
   1950: {1,2,3,3,6}
   2268: {1,1,2,2,2,2,4}
   2430: {1,2,2,2,2,2,3}

Crossrefs

For just primes instead of prime powers we have A363722.
Including prime-powers gives A363727, counted by A363719.
These partitions are counted by A363728.
For unequal instead of equal we have A363730, counted by A363720.
A000961 lists the prime powers, complement A024619.
A112798 lists prime indices, length A001222, sum A056239.
A326567/A326568 gives mean of prime indices.
A356862 ranks partitions with a unique mode, counted by A362608.
A359178 ranks partitions with multiple modes, counted by A362610.
A360005 gives twice the median of prime indices.
A362611 counts modes in prime indices, triangle A362614.
A362613 counts co-modes in prime indices, triangle A362615.
A363486 gives least mode in prime indices, A363487 greatest.
Just two statistics:
- (mean) = (median): A359889, counted by A240219.
- (mean) != (median): A359890, counted by A359894.
- (mean) = (mode): counted by A363723, see A363724, A363731.
- (median) = (mode): counted by A363740.
Cf. A215366, A327473, A327476, A359893, A359908, A360009, A360248, A360550, A363721, A363725, A363741.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
Select[Range[1000],!PrimePowerQ[#]&&{Mean[prix[#]]}=={Median[prix[#]]}==modes[prix[#]]&]

A363721 Number of odd-length integer partitions of n satisfying (mean) = (median) = (mode), assuming there is a unique mode.

Original entry on oeis.org

1, 1, 2, 1, 2, 2, 2, 1, 3, 3, 2, 2, 2, 5, 7, 1, 2, 8, 2, 9, 16, 11, 2, 2, 15, 16, 37, 33, 2, 44, 2, 1, 79, 33, 103, 127, 2, 47, 166, 39, 2, 214, 2, 384, 738, 90, 2, 2, 277, 185, 631, 1077, 2, 1065, 1560, 477, 1156, 223, 2, 2863
Offset: 1

Views

Author

Gus Wiseman, Jun 21 2023

Keywords

Comments

The median of an odd-length partition is the middle part.
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 = {1, 3, 9, 14, 15, 18, 20, 22} (A..M = 10..22):
  1  3    9          E        F                I          K      M
     111  333        2222222  555              666        44444  22222222222
          111111111  3222221  33333            222222222  54443  32222222221
                     3322211  43332            322222221  64442  33222222211
                     4222211  53331            332222211  65441  33322222111
                              63321            422222211  74432  42222222211
                              111111111111111  432222111  74441  43222222111
                                               522222111  84431  44222221111
                                                          94421  52222222111
                                                                 53222221111
                                                                 62222221111

Crossrefs

All odd-length partitions are counted by A027193.
For just (mean) = (median) we have A359895, also A240219, A359899, A359910.
For just (mean) != (median) we have A359896, also A359894, A359900.
Allowing any length gives A363719, ranks A363727, non-constant A363728.
A000041 counts partitions, strict A000009.
A008284 counts partitions by length (or negative mean), strict A008289.
A359893 and A359901 count partitions by median, odd-length A359902.
A362608 counts partitions with a unique mode.
A363726 counts odd-length partitions with a unique mode.
Cf. A237984, A325347, A326567/A326568, A327472, A363720, A363740, A363741.

Programs

  • Mathematica
    modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
Table[Length[Select[IntegerPartitions[n],OddQ[Length[#]]&&{Mean[#]}=={Median[#]}==modes[#]&]],{n,30}]

A362562 Number of non-constant integer partitions of n having a unique mode equal to the mean.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 4, 0, 3, 3, 7, 0, 12, 0, 18, 12, 9, 0, 52, 12, 14, 33, 54, 0, 121, 0, 98, 76, 31, 100, 343, 0, 45, 164, 493, 0, 548, 0, 483, 757, 88, 0, 1789, 289, 979, 645, 1290, 0, 2225, 1677, 3371, 1200, 221, 0, 10649
Offset: 0

Views

Author

Gus Wiseman, Jun 27 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(8) = 1 through a(16) = 7 partitions:
  (3221)  .  (32221)  .  (4332)    .  (3222221)  (43332)  (5443)
                         (5331)       (3322211)  (53331)  (6442)
                         (322221)     (4222211)  (63321)  (7441)
                         (422211)                         (32222221)
                                                          (33222211)
                                                          (42222211)
                                                          (52222111)

Crossrefs

Partitions containing their mean are counted by A237984, ranks A327473.
Partitions missing their mean are counted by A327472, ranks A327476.
Allowing constant partitions gives A363723.
Including median also gives A363728, ranks A363729.
A000041 counts partitions, strict A000009.
A008284 counts partitions by length (or decreasing mean), strict A008289.
A359893 and A359901 count partitions by median.
A362608 counts partitions with a unique mode.
Cf. A240219, A325347, A363719, A363720, A363724, A363725, A363731, A363740.

Programs

  • Mathematica
    modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
Table[Length[Select[IntegerPartitions[n],!SameQ@@#&&{Mean[#]}==modes[#]&]],{n,0,30}]

A363722 Nonprime numbers whose prime indices satisfy (mean) = (median) = (mode), assuming there is a unique mode.

Original entry on oeis.org

4, 8, 9, 16, 25, 27, 32, 49, 64, 81, 90, 121, 125, 128, 169, 243, 256, 270, 289, 343, 361, 512, 525, 529, 550, 625, 729, 756, 810, 841, 961, 1024, 1331, 1369, 1666, 1681, 1849, 1911, 1950, 2048, 2187, 2197, 2209, 2268, 2401, 2430, 2625, 2695, 2700, 2750, 2809
Offset: 1

Views

Author

Gus Wiseman, Jun 24 2023

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.
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}.
The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).

Examples

			The terms together with their prime indices begin:
     4: {1,1}
     8: {1,1,1}
     9: {2,2}
    16: {1,1,1,1}
    25: {3,3}
    27: {2,2,2}
    32: {1,1,1,1,1}
    49: {4,4}
    64: {1,1,1,1,1,1}
    81: {2,2,2,2}
    90: {1,2,2,3}
   121: {5,5}
   125: {3,3,3}
   128: {1,1,1,1,1,1,1}

Crossrefs

These partitions are counted by A363719 - 1 for n > 0.
Including primes gives A363727, counted by A363719.
For prime powers instead of just primes we have A363729, counted by A363728.
For unequal instead of equal we have A363730, counted by A363720.
A112798 lists prime indices, length A001222, sum A056239.
A326567/A326568 gives mean of prime indices.
A356862 ranks partitions with a unique mode, counted by A362608.
A359178 ranks partitions with multiple modes, counted by A362610.
A360005 gives twice the median of prime indices.
A362611 counts modes in prime indices, triangle A362614.
A362613 counts co-modes in prime indices, triangle A362615.
A363486 gives least mode in prime indices, A363487 greatest.
Just two statistics:
- (mean) = (median): A359889, counted by A240219.
- (mean) != (median): A359890, counted by A359894.
- (mean) = (mode): counted by A363723, see A363724, A363731.
- (median) = (mode): counted by A363740.
Cf. A000961, A327473, A327476, A359893, A359908, A360009, A360550, A363721, A363725, A363741.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
Select[Range[100],!PrimeQ[#]&&{Mean[prix[#]]}=={Median[prix[#]]}==modes[prix[#]]&]

Formula

Complement of A000040 in A363727.
Assuming there is a unique mode, we have A326567(a(n))/A326568(a(n)) = A360005(a(n))/2 = A363486(a(n)) = A363487(a(n)).
Showing 1-9 of 9 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.