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 91-100 of 132 results. Next

A361857 Number of integer partitions of n such that the maximum is greater than twice the median.

Original entry on oeis.org

0, 0, 0, 0, 1, 2, 3, 7, 11, 16, 25, 37, 52, 74, 101, 138, 185, 248, 325, 428, 554, 713, 914, 1167, 1476, 1865, 2336, 2922, 3633, 4508, 5562, 6854, 8405, 10284, 12536, 15253, 18489, 22376, 26994, 32507, 39038, 46802, 55963, 66817, 79582, 94643, 112315
Offset: 1

Views

Author

Gus Wiseman, Apr 02 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).

Examples

			The a(5) = 1 through a(10) = 16 partitions:
  (311)  (411)   (511)    (521)     (522)      (622)
         (3111)  (4111)   (611)     (621)      (721)
                 (31111)  (4211)    (711)      (811)
                          (5111)    (5211)     (5221)
                          (32111)   (6111)     (5311)
                          (41111)   (33111)    (6211)
                          (311111)  (42111)    (7111)
                                    (51111)    (43111)
                                    (321111)   (52111)
                                    (411111)   (61111)
                                    (3111111)  (331111)
                                               (421111)
                                               (511111)
                                               (3211111)
                                               (4111111)
                                               (31111111)
The partition y = (5,2,2,1) has maximum 5 and median 2, and 5 > 2*2, so y is counted under a(10).
		

Crossrefs

For length instead of median we have A237751.
For minimum instead of median we have A237820.
The complement is counted by A361848.
The equal version is A361849, ranks A361856.
Reversing the inequality gives A361858.
Allowing equality gives A361859, ranks A361868.
These partitions have ranks A361867.
For mean instead of median we have A361907.
A000041 counts integer partitions, strict A000009.
A000975 counts subsets with integer median.
A325347 counts partitions with integer median, complement A307683.
A359893 and A359901 count partitions by median.
A360005 gives twice median of prime indices, distinct A360457.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],Max@@#>2*Median[#]&]],{n,30}]

A361864 Number of set partitions of {1..n} whose block-medians have integer median.

Original entry on oeis.org

1, 0, 3, 6, 30, 96, 461, 2000, 10727, 57092, 342348
Offset: 1

Views

Author

Gus Wiseman, Apr 04 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).

Examples

			The a(1) = 1 through a(4) = 6 set partitions:
  {{1}}  .  {{123}}      {{1}{234}}
            {{13}{2}}    {{123}{4}}
            {{1}{2}{3}}  {{1}{2}{34}}
                         {{12}{3}{4}}
                         {{1}{24}{3}}
                         {{13}{2}{4}}
The set partition {{1,2},{3},{4}} has block-medians {3/2,3,4}, with median 3, so is counted under a(4).
		

Crossrefs

For mean instead of median we have A361865.
For sum instead of outer median we have A361911, means A361866.
A000110 counts set partitions.
A000975 counts subsets with integer median, mean A327475.
A013580 appears to count subsets by median, A327481 by mean.
A308037 counts set partitions with integer average block-size.
A325347 counts partitions w/ integer median, complement A307683.
A360005 gives twice median of prime indices, distinct A360457.

Programs

  • Mathematica
    sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]& /@ sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
    Table[Length[Select[sps[Range[n]],IntegerQ[Median[Median/@#]]&]],{n,6}]

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.

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[#]]&]

A363741 Number of factorizations of n satisfying (mean) = (median) = (mode), assuming there is a unique mode.

Original entry on oeis.org

0, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1
Offset: 1

Views

Author

Gus Wiseman, Jun 26 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}.
The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).
Position of first appearance of n is: (1, 2, 4, 16, 64, 5832, 4096, ...).

Examples

			The factorization 6*9*9*12 = 5832 has mean 9, median 9, and modes {9}, so it is counted under a(5832).
The a(n) factorizations for selected n:
2   4     16        64            5832              4096
    2*2   4*4       8*8           18*18*18          64*64
          2*2*2*2   4*4*4         6*9*9*12          8*8*8*8
                    2*2*2*2*2*2   3*6*6*6*9         16*16*16
                                  2*3*3*3*3*3*3*4   4*4*4*4*4*4
                                                    2*2*2*2*2*2*2*2*2*2*2*2
		

Crossrefs

For just (mean) = (median): A359909, see A240219, A359889, A359910, A359911.
The version for partitions is A363719, unequal A363720.
For unequal instead of equal we have A363742.
A000041 counts integer partitions.
A001055 counts factorizations, strict A045778, ordered A074206.
A089723 counts constant factorizations.
A316439 counts factorizations by length, A008284 partitions.
A326622 counts factorizations with integer mean, strict A328966.
A339846 counts even-length factorizations, A339890 odd-length.

Programs

  • Mathematica
    facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&, Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
    modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
    Table[Length[Select[facs[n],{Mean[#]}=={Median[#]}==modes[#]&]],{n,100}]

A360455 Number of integer partitions of n for which the distinct parts have the same median as the multiplicities.

Original entry on oeis.org

1, 1, 0, 0, 2, 1, 1, 0, 2, 2, 5, 8, 10, 14, 20, 19, 26, 31, 35, 41, 55, 65, 85, 102, 118, 151, 181, 201, 236, 281, 313, 365, 424, 495, 593, 688, 825, 978, 1181, 1374, 1650, 1948, 2323, 2682, 3175, 3680, 4314, 4930, 5718, 6546, 7532, 8557, 9777, 11067, 12622
Offset: 0

Views

Author

Gus Wiseman, Feb 10 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).

Examples

			The a(1) = 1 through a(11) = 8 partitions:
  1   .  .  22    221   3111   .  3311    333     3331     32222
            211                   41111   32211   33211    33221
                                                  42211    44111
                                                  322111   52211
                                                  511111   322211
                                                           332111
                                                           422111
                                                           3221111
		

Crossrefs

For mean instead of median: A114638, ranks A324570.
For parts instead of multiplicities: A360245, ranks A360249.
These partitions have ranks A360453.
For parts instead of distinct parts: A360456, ranks A360454.
A000041 counts integer partitions, strict A000009.
A116608 counts partitions by number of distinct parts.
A325347 counts partitions w/ integer median, strict A359907, ranks A359908.
A359893 and A359901 count partitions by median, odd-length A359902.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n], Median[Length/@Split[#]]==Median[Union[#]]&]],{n,0,30}]

A360952 Number of strict integer partitions of n with non-integer median; a(0) = 1.

Original entry on oeis.org

1, 0, 0, 1, 0, 2, 0, 3, 0, 4, 1, 6, 1, 8, 4, 11, 5, 15, 10, 20, 13, 27, 22, 36, 28, 47, 43, 63, 56, 82, 79, 107, 103, 140, 141, 180, 181, 232, 242, 299, 308, 380, 402, 483, 511, 613, 656, 772, 824, 969, 1047, 1215, 1309, 1514, 1642, 1882, 2039, 2334, 2539, 2882
Offset: 0

Views

Author

Gus Wiseman, Mar 10 2023

Keywords

Comments

All of these partitions have even length.
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 a(0) = 1 through a(15) = 11 partitions (0 = {}, A..E = 10..14):
  0  .  .  21  .  32  .  43  .  54  4321  65    6321  76    5432  87
                  41     52     63        74          85    6431  96
                         61     72        83          94    6521  A5
                                81        92          A3    8321  B4
                                          A1          B2          C3
                                          5321        C1          D2
                                                      5431        E1
                                                      7321        6432
                                                                  7431
                                                                  7521
                                                                  9321
		

Crossrefs

The non-strict version is A307683, ranks A359912.
The non-strict complement is A325347, ranks A359908.
The strict complement is counted by A359907.
For mean instead of median we have A361391, non-strict A349156.
A000041 counts partitions, strict A000009.
A008284/A058398/A327482 count partitions by mean.
A067538 = partitions with integer mean, complement A102627, ranks A316413.
A359893/A359901/A359902 count partitions by median.
A360005(n)/2 ranks the median statistic.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n], UnsameQ@@#&&!IntegerQ[Median[#]]&]],{n,0,30}]

Formula

a(n) = A000009(n) - A359907(n).

A361867 Positive integers > 1 whose prime indices satisfy (maximum) > 2*(median).

Original entry on oeis.org

20, 28, 40, 44, 52, 56, 66, 68, 76, 78, 80, 84, 88, 92, 99, 102, 104, 112, 114, 116, 117, 120, 124, 132, 136, 138, 148, 152, 153, 156, 160, 164, 168, 170, 171, 172, 174, 176, 184, 186, 188, 190, 198, 200, 204, 207, 208, 212, 220, 222, 224, 228, 230, 232, 234
Offset: 1

Views

Author

Gus Wiseman, Apr 05 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.
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 84 are {1,1,2,4}, with maximum 4 and median 3/2, and 4 > 2*(3/2), so 84 is in the sequence.
The terms together with their prime indices begin:
   20: {1,1,3}
   28: {1,1,4}
   40: {1,1,1,3}
   44: {1,1,5}
   52: {1,1,6}
   56: {1,1,1,4}
   66: {1,2,5}
   68: {1,1,7}
   76: {1,1,8}
   78: {1,2,6}
   80: {1,1,1,1,3}
   84: {1,1,2,4}
   88: {1,1,1,5}
   92: {1,1,9}
   99: {2,2,5}
		

Crossrefs

The LHS is A061395 (greatest prime index).
The RHS is A360005 (twice median), distinct A360457.
The equal version is A361856, counted by A361849.
These partitions are counted by A361857, reverse A361858.
Including the equal case gives A361868, counted by A361859.
For mean instead of median we have A361907.
A000975 counts subsets with integer median.
A001222 counts prime factors, distinct A001221.
A112798 lists prime indices, sum A056239.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n], {p_,k_}:>Table[PrimePi[p],{k}]]]];
    Select[Range[100], Max@@prix[#]>2*Median[prix[#]]&]

A361868 Positive integers > 1 whose prime indices satisfy (maximum) >= 2*(median).

Original entry on oeis.org

12, 20, 24, 28, 40, 42, 44, 48, 52, 56, 60, 63, 66, 68, 72, 76, 78, 80, 84, 88, 92, 96, 99, 102, 104, 112, 114, 116, 117, 120, 124, 126, 130, 132, 136, 138, 140, 144, 148, 152, 153, 156, 160, 164, 168, 170, 171, 172, 174, 176, 184, 186, 188, 189, 190, 192, 195
Offset: 1

Views

Author

Gus Wiseman, Apr 05 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.
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 84 are {1,1,2,4}, with maximum 4 and median 3/2, and 4 >= 2*(3/2), so 84 is in the sequence.
The terms together with their prime indices begin:
   12: {1,1,2}
   20: {1,1,3}
   24: {1,1,1,2}
   28: {1,1,4}
   40: {1,1,1,3}
   42: {1,2,4}
   44: {1,1,5}
   48: {1,1,1,1,2}
   52: {1,1,6}
   56: {1,1,1,4}
   60: {1,1,2,3}
   63: {2,2,4}
   66: {1,2,5}
   68: {1,1,7}
   72: {1,1,1,2,2}
		

Crossrefs

The LHS is A061395 (greatest prime index).
The RHS is A360005 (twice median), distinct A360457.
The equal case is A361856, counted by A361849.
These partitions are counted by A361859.
The unequal case is A361867, counted by A361857.
The complement is counted by A361858.
A000975 counts subsets with integer median.
A001222 (bigomega) counts prime factors, distinct A001221 (omega).
A112798 lists prime indices, sum A056239.
A325347 counts partitions with integer median, complement A307683.
A359893 and A359901 count partitions by median.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    Select[Range[100],Max@@prix[#]>=2*Median[prix[#]]&]

A363126 Irregular triangle read by rows where T(n,k) is the number of integer partitions of n with k non-modes, all 0's removed.

Original entry on oeis.org

1, 1, 2, 3, 4, 1, 4, 3, 8, 3, 6, 8, 1, 10, 9, 3, 11, 13, 6, 15, 18, 9, 13, 24, 18, 1, 25, 24, 25, 3, 19, 36, 40, 6, 29, 41, 52, 13, 33, 45, 79, 19, 42, 57, 95, 36, 1, 39, 68, 133, 54, 3, 62, 72, 158, 87, 6, 55, 87, 214, 121, 13, 81, 95, 250, 177, 24
Offset: 0

Views

Author

Gus Wiseman, May 16 2023

Keywords

Comments

A non-mode in a multiset is an element that appears fewer times than at least one of the others. For example, the non-modes in {a,a,b,b,b,c,d,d,d} are {a,c}.

Examples

			Triangle begins:
   1
   1
   2
   3
   4   1
   4   3
   8   3
   6   8   1
  10   9   3
  11  13   6
  15  18   9
  13  24  18   1
  25  24  25   3
  19  36  40   6
  29  41  52  13
  33  45  79  19
  42  57  95  36   1
  39  68 133  54   3
Row n = 9 counts the following partitions:
  (9)          (441)       (3321)
  (54)         (522)       (4221)
  (63)         (711)       (4311)
  (72)         (3222)      (5211)
  (81)         (6111)      (42111)
  (333)        (22221)     (321111)
  (432)        (32211)
  (531)        (33111)
  (621)        (51111)
  (222111)     (411111)
  (111111111)  (2211111)
               (3111111)
               (21111111)
		

Crossrefs

Row sums are A000041.
Row lengths are approximately A000196.
Column k = 0 is A047966.
For modes we have A362614, rank statistic A362611.
For co-modes we have A362615, rank statistic A362613.
Columns k > 1 sum to A363124.
Column k = 1 is A363125.
This rank statistic (number of non-modes) is A363127.
For non-co-modes we have A363130, rank statistic A363131.
A008284/A058398 count partitions by length/mean.
A275870 counts collapsible partitions.
A353836 counts partitions by number of distinct run-sums.
A359893 counts partitions by median.

Programs

  • Mathematica
    nmsi[ms_]:=Select[Union[ms],Count[ms,#]
    				

A361911 Number of set partitions of {1..n} with block-medians summing to an integer.

Original entry on oeis.org

1, 1, 3, 10, 30, 107, 479, 2249, 11173, 60144, 351086, 2171087, 14138253, 97097101, 701820663, 5303701310, 41838047938, 343716647215, 2935346815495, 25999729551523, 238473713427285, 2261375071834708, 22141326012712122, 223519686318676559, 2323959300370456901
Offset: 1

Views

Author

Gus Wiseman, Apr 14 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).

Examples

			The a(1) = 1 through a(4) = 10 set partitions:
  {{1}}  {{1}{2}}  {{123}}      {{1}{234}}
                   {{13}{2}}    {{12}{34}}
                   {{1}{2}{3}}  {{123}{4}}
                                {{124}{3}}
                                {{13}{24}}
                                {{134}{2}}
                                {{14}{23}}
                                {{1}{24}{3}}
                                {{13}{2}{4}}
                                {{1}{2}{3}{4}}
The set partition {{1,4},{2,3}} has medians {5/2,5/2}, with sum 5, so is counted under a(4).
		

Crossrefs

For median instead of sum we have A361864.
For mean of means we have A361865.
For mean instead of median we have A361866.
A000110 counts set partitions.
A000975 counts subsets with integer median, mean A327475.
A013580 appears to count subsets by median, A327481 by mean.
A308037 counts set partitions with integer average block-size.
A325347 = partitions w/ integer median, complement A307683, strict A359907.
A360005 gives twice median of prime indices, distinct A360457.

Programs

  • Mathematica
    sps[{}]:={{}}; sps[set:{i_,_}] := Join@@Function[s,Prepend[#,s]& /@ sps[Complement[set,s]]] /@ Cases[Subsets[set],{i,_}];
    Table[Length[Select[sps[Range[n]], IntegerQ[Total[Median/@#]]&]],{n,10}]

Extensions

a(12)-a(25) from Christian Sievers, Aug 26 2024
Previous Showing 91-100 of 132 results. Next