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

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

A363953 Number of integer partitions of n with high mode k.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 2, 1, 1, 1, 0, 3, 1, 1, 1, 1, 0, 4, 2, 2, 1, 1, 1, 0, 7, 2, 1, 2, 1, 1, 1, 0, 9, 4, 2, 2, 2, 1, 1, 1, 0, 13, 6, 2, 2, 2, 2, 1, 1, 1, 0, 18, 7, 4, 3, 3, 2, 2, 1, 1, 1, 0, 26, 10, 5, 2, 3, 3, 2, 2, 1, 1, 1
Offset: 0

Views

Author

Gus Wiseman, Jul 07 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}.
Extending the terminology of A124944, the "high mode" in a multiset is the greatest mode.

Examples

			Triangle begins:
  1
  0  1
  0  1  1
  0  1  1  1
  0  2  1  1  1
  0  3  1  1  1  1
  0  4  2  2  1  1  1
  0  7  2  1  2  1  1  1
  0  9  4  2  2  2  1  1  1
  0 13  6  2  2  2  2  1  1  1
  0 18  7  4  3  3  2  2  1  1  1
  0 26 10  5  2  3  3  2  2  1  1  1
  0 32 15  8  4  4  4  3  2  2  1  1  1
  0 47 19  9  5  3  4  4  3  2  2  1  1  1
  0 60 26 13  7  5  5  5  4  3  2  2  1  1  1
  0 79 34 18 10  6  5  5  5  4  3  2  2  1  1  1
Row n = 9 counts the following partitions:
  .  (711)        (522)     (333)   (441)  (54)   (63)   (72)  (81)  (9)
     (6111)       (4221)    (3321)  (432)  (531)  (621)
     (5211)       (3222)
     (51111)      (32211)
     (4311)       (22221)
     (42111)      (222111)
     (411111)
     (33111)
     (321111)
     (3111111)
     (2211111)
     (21111111)
     (111111111)

Crossrefs

Row sums are A000041.
For median: A124944 (low A124943), rank statistic A363942 (low A363941).
Column k = 1 is A241131 (partitions w/ high mode 1), ranks A360013, A360015.
The rank statistic for this triangle is A363487, low A363486.
For mean: A363946 (low A363945), rank statistic A363944 (low A363943).
The low version is A363952.
A008284 counts partitions by length, A058398 by mean.
A362612 counts partitions (max part) = (unique mode), ranks A362616.
A362614 counts partitions by number of modes, rank statistic A362611.
A362615 counts partitions by number of co-modes, rank statistic A362613.
Cf. A362610, A362608, A362607, A362609; A359178, A356862, A362605, A362606.
Cf. A002865, A025065, A026905, A237984, A363723, A363724, A363731.

Programs

  • Mathematica
    modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
Table[Length[Select[IntegerPartitions[n], If[Length[#]==0,0,Last[modes[#]]]==k&]],{n,0,15},{k,0,n}]

A363726 Number of odd-length integer partitions of n with a unique mode.

Original entry on oeis.org

0, 1, 1, 2, 2, 4, 4, 7, 8, 12, 14, 22, 26, 39, 50, 67, 86, 118, 148, 196, 245, 315, 394, 507, 629, 792, 979, 1231, 1503, 1873, 2286, 2814, 3424, 4194, 5073, 6183, 7449, 9014, 10827, 13055, 15603, 18713, 22308, 26631, 31646, 37641, 44559, 52835, 62374, 73671
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(1) = 1 through a(8) = 8 partitions:
  (1)  (2)  (3)    (4)    (5)      (6)      (7)        (8)
            (111)  (211)  (221)    (222)    (322)      (332)
                          (311)    (411)    (331)      (422)
                          (11111)  (21111)  (511)      (611)
                                            (22111)    (22211)
                                            (31111)    (32111)
                                            (1111111)  (41111)
                                                       (2111111)

Crossrefs

The constant case is A001227.
Allowing multiple modes gives A027193, ranks A026424.
Allowing any length gives A362608, ranks A356862.
A000041 counts partitions, strict A000009.
A008284 counts partitions by length (or decreasing mean), strict A008289.
A359893 and A359901 count partitions by median.
Cf. A325347, A363719, A363720, A363731, A363724, A363725, A363740.

Programs

  • Mathematica
    modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
Table[Length[Select[IntegerPartitions[n], Length[modes[#]]==1&&OddQ[Length[#]]&]],{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)).

A364059 Number of integer partitions of n whose rounded mean is > 1. Partitions with mean >= 3/2.

Original entry on oeis.org

0, 0, 1, 2, 3, 5, 9, 11, 18, 26, 35, 49, 70, 89, 123, 164, 212, 278, 366, 460, 597, 762, 957, 1210, 1530, 1891, 2369, 2943, 3621, 4468, 5507, 6703, 8210, 10004, 12115, 14688, 17782, 21365, 25743, 30913, 36965, 44210, 52801, 62753, 74667, 88626, 104874, 124070
Offset: 0

Views

Author

Gus Wiseman, Jul 06 2023

Keywords

Comments

We use the "rounding half to even" rule, see link.

Examples

			The a(0) = 0 through a(8) = 18 partitions:
  .  .  (2)  (3)   (4)   (5)    (6)     (7)     (8)
             (21)  (22)  (32)   (33)    (43)    (44)
                   (31)  (41)   (42)    (52)    (53)
                         (221)  (51)    (61)    (62)
                         (311)  (222)   (322)   (71)
                                (321)   (331)   (332)
                                (411)   (421)   (422)
                                (2211)  (511)   (431)
                                (3111)  (2221)  (521)
                                        (3211)  (611)
                                        (4111)  (2222)
                                                (3221)
                                                (3311)
                                                (4211)
                                                (5111)
                                                (22211)
                                                (32111)
                                                (41111)

Links

Crossrefs

Rounding-up gives A000065.
Rounding-down gives A110618, ranks A344291.
For median instead of mean we appear to have A238495.
The complement is counted by A363947, ranks A363948.
A000041 counts integer partitions.
A008284 counts partitions by length, A058398 by mean.
A025065 counts partitions with low mean 1, ranks A363949.
A067538 counts partitions with integer mean, ranks A316413.
A124943 counts partitions by low median, high A124944.
Cf. A002865, A098859, A241131, A327482, A363723, A363724, A363731, A363946.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],Round[Mean[#]]>1&]],{n,0,30}]

Formula

a(n) = A000041(n) - A363947(n).

A364060 Triangle read by rows where T(n,k) is the number of integer partitions of n with rounded mean k.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 2, 2, 0, 1, 0, 2, 4, 0, 0, 1, 0, 2, 5, 3, 0, 0, 1, 0, 4, 7, 0, 3, 0, 0, 1, 0, 4, 8, 5, 4, 0, 0, 0, 1, 0, 4, 14, 7, 4, 0, 0, 0, 0, 1, 0, 7, 21, 8, 0, 5, 0, 0, 0, 0, 1, 0, 7, 22, 11, 10, 0, 5, 0, 0, 0, 0, 1
Offset: 0

Views

Author

Gus Wiseman, Jul 07 2023

Keywords

Comments

We use the "rounding half to even" rule, see link.

Examples

			Triangle begins:
  1
  0  1
  0  1  1
  0  1  1  1
  0  2  2  0  1
  0  2  4  0  0  1
  0  2  5  3  0  0  1
  0  4  7  0  3  0  0  1
  0  4  8  5  4  0  0  0  1
  0  4 14  7  4  0  0  0  0  1
  0  7 21  8  0  5  0  0  0  0  1
  0  7 22 11 10  0  5  0  0  0  0  1
  0  7 36 15 12  0  6  0  0  0  0  0  1
  0 12 32 36 14  0  6  0  0  0  0  0  0  1
  0 12 53 23 23 16  0  7  0  0  0  0  0  0  1
  0 12 80 30 27 19  0  0  7  0  0  0  0  0  0  1
Row n = 7 counts the following partitions:
  .  (31111)    (511)   .  (61)  .  .  (7)
     (22111)    (421)      (52)
     (211111)   (4111)     (43)
     (1111111)  (331)
                (322)
                (3211)
                (2221)

Links

Crossrefs

Row sums are A000041.
The rank statistic for this triangle is A363489.
The version for low mean is A363945, rank statistic A363943.
The version for high mean is A363946, rank statistic A363944.
Column k = 1 is A363947 (A026905 tripled).
A008284 counts partitions by length, A058398 by mean.
A026905 redoubled counts partitions with high mean 2, ranks A363950.
A051293 counts subsets with integer mean, median A000975.
A067538 counts partitions with integer mean, strict A102627, ranks A316413.
More triangles: A124943, A124944, A363952, A363953.
Cf. A002865, A025065, A237984, A327472, A327482, A363723, A363724, A363731.

Programs

  • Mathematica
    Table[If[n==k==0,1,Length[Select[IntegerPartitions[n], Round[Mean[#]]==k&]]],{n,0,15},{k,0,n}]
Previous Showing 11-17 of 17 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.