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 21-30 of 80 results. Next

A359897 Number of strict integer partitions of n whose parts have the same mean as median.

Original entry on oeis.org

0, 1, 1, 2, 2, 3, 4, 4, 4, 7, 6, 6, 10, 7, 10, 13, 11, 9, 20, 10, 20, 18, 21, 12, 30, 24, 28, 27, 30, 15, 73, 16, 37, 43, 45, 67, 74, 19, 55, 71, 126, 21, 150, 22, 75, 225, 78, 24, 183, 126, 245, 192, 132, 27, 284, 244, 403, 303, 120, 30, 828
Offset: 0

Views

Author

Gus Wiseman, Jan 20 2023

Keywords

Examples

			The a(1) = 1 through a(9) = 7 partitions:
  (1)  (2)  (3)    (4)    (5)    (6)      (7)    (8)    (9)
            (2,1)  (3,1)  (3,2)  (4,2)    (4,3)  (5,3)  (5,4)
                          (4,1)  (5,1)    (5,2)  (6,2)  (6,3)
                                 (3,2,1)  (6,1)  (7,1)  (7,2)
                                                        (8,1)
                                                        (4,3,2)
                                                        (5,3,1)
		

Crossrefs

The non-strict version is A240219, complement A359894, ranked by A359889.
The complement is counted by A359898.
The odd-length case is A359899, complement A359900.
A000041 counts partitions, strict A000009.
A008284/A058398/A327482 count partitions by mean, ranked by A326567/A326568.
A008289 counts strict partitions by mean.
A237984 counts partitions containing their mean, complement A327472.
A240850 counts strict partitions containing their mean, complement A240851.
A325347 counts ptns with integer median, strict A359907, ranked by A359908.

Programs

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

A360555 Two times the median of the first differences of the 0-prepended prime indices of n > 1.

Original entry on oeis.org

2, 4, 1, 6, 2, 8, 0, 2, 3, 10, 2, 12, 4, 3, 0, 14, 2, 16, 2, 4, 5, 18, 1, 3, 6, 0, 2, 20, 2, 22, 0, 5, 7, 4, 1, 24, 8, 6, 1, 26, 2, 28, 2, 2, 9, 30, 0, 4, 2, 7, 2, 32, 1, 5, 1, 8, 10, 34, 2, 36, 11, 4, 0, 6, 2, 38, 2, 9, 2, 40, 0, 42, 12, 2, 2, 5, 2, 44, 0, 0
Offset: 2

Views

Author

Gus Wiseman, Feb 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). Since the denominator is always 1 or 2, the median can be represented as an integer by multiplying by 2.
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 0-prepended prime indices of 1617 are {0,2,4,4,5}, with sorted differences {0,1,2,2}, with median 3/2, so a(1617) = 3.
		

Crossrefs

The version for divisors is A063655.
Differences of 0-prepended prime indices are listed by A287352.
The version for prime indices is A360005.
The version for distinct prime indices is A360457.
The version for distinct prime factors is A360458.
The version for prime factors is A360459.
The version for prime multiplicities is A360460.
Positions of even terms are A360556
Positions of odd terms are A360557
Positions of 0's are A360558, counted by A360254.
For mean instead of two times median we have A360614/A360615.
A112798 lists prime indices, length A001222, sum A056239.
A325347 counts partitions with integer median, complement A307683.
A326567/A326568 gives mean of prime indices.
A359893 and A359901 count partitions by median, odd-length A359902.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    Table[2*Median[Differences[Prepend[prix[n],0]]],{n,2,100}]

A360556 Numbers > 1 whose first differences of 0-prepended prime indices have integer median.

Original entry on oeis.org

2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 14, 16, 17, 18, 19, 20, 21, 23, 26, 27, 28, 29, 30, 31, 32, 35, 37, 38, 39, 41, 42, 43, 44, 45, 47, 48, 49, 50, 52, 53, 57, 58, 59, 60, 61, 63, 64, 65, 66, 67, 68, 70, 71, 72, 73, 74, 75, 76, 78, 79, 80, 81, 83, 84, 86, 87, 89
Offset: 1

Views

Author

Gus Wiseman, Feb 16 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 0-prepended prime indices of 1617 are {0,2,4,4,5}, with sorted differences {0,1,2,2}, with median 3/2, so 1617 is not in the sequence.
		

Crossrefs

For mean instead of median we have A340610.
Positions of even terms in A360555.
The complement is A360557 (without 1).
These partitions are counted by A360688.
- For divisors (A063655) we have A139711, complement A139710.
- For prime indices (A360005) we have A359908, complement A359912.
- For distinct prime indices (A360457) we have A360550, complement A360551.
- For distinct prime factors (A360458) we have A360552, complement A100367.
- For prime factors (A360459) we have A359913, complement A072978.
- For prime multiplicities (A360460) we have A360553, complement A360554.
- For 0-prepended differences (A360555) we have A360556, complement A360557.
A112798 lists prime indices, length A001222, sum A056239.
A325347 = partitions w/ integer median, complement A307683, strict A359907.
A359893 and A359901 count partitions by median, odd-length A359902.
A360614/A360615 = mean of first differences of 0-prepended prime indices.

Programs

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

A360009 Numbers whose prime indices have integer mean and integer median.

Original entry on oeis.org

2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 16, 17, 19, 21, 22, 23, 25, 27, 28, 29, 30, 31, 32, 34, 37, 39, 41, 43, 46, 47, 49, 53, 55, 57, 59, 61, 62, 64, 67, 68, 71, 73, 78, 79, 81, 82, 83, 85, 87, 88, 89, 90, 91, 94, 97, 98, 99, 100, 101, 103, 105, 107, 109, 110, 111
Offset: 1

Views

Author

Gus Wiseman, Jan 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.
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}
    3: {2}
    4: {1,1}
    5: {3}
    7: {4}
    8: {1,1,1}
    9: {2,2}
   10: {1,3}
   11: {5}
   13: {6}
   16: {1,1,1,1}
   17: {7}
   19: {8}
   21: {2,4}
   22: {1,5}
   23: {9}
   25: {3,3}
   27: {2,2,2}
   28: {1,1,4}
		

Crossrefs

For just integer mean we have A316413 (counted by A067538).
The mean of prime indices is given by A326567/A326568.
The complement is A348551 \/ A359912 (counted by A349156 and A307683).
These partitions are counted by A359906.
For just integer median we have A359908 (counted by A325347).
The median of prime indices is given by A360005/2.
A058398 counts partitions by mean, see also A008284, A327482.
A112798 lists prime indices, length A001222, sum A056239.
A326622 counts factorizations with integer mean, strict A328966.
A359893 and A359901 count partitions by median, odd-length A359902.

Programs

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

Formula

Intersection of A316413 and A359908.

A363942 High median in the multiset of prime indices of n.

Original entry on oeis.org

0, 1, 2, 1, 3, 2, 4, 1, 2, 3, 5, 1, 6, 4, 3, 1, 7, 2, 8, 1, 4, 5, 9, 1, 3, 6, 2, 1, 10, 2, 11, 1, 5, 7, 4, 2, 12, 8, 6, 1, 13, 2, 14, 1, 2, 9, 15, 1, 4, 3, 7, 1, 16, 2, 5, 1, 8, 10, 17, 2, 18, 11, 2, 1, 6, 2, 19, 1, 9, 3, 20, 1, 21, 12, 3, 1, 5, 2, 22, 1, 2
Offset: 1

Views

Author

Gus Wiseman, Jul 01 2023

Keywords

Comments

The high median (see A124944) in a multiset is either the middle part (for odd length), or the greatest of the two middle parts (for even length).
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 90 are {1,2,2,3}, with high median 2, so a(90) = 2.
The prime indices of 150 are {1,2,3,3}, with high median 3, so a(150) = 3.
		

Crossrefs

Positions of first appearances are 1 and A000040.
The triangle for this statistic (high median) is A124944, low A124943.
Regular median of prime indices is A360005(n)/2.
For mode instead of median we have A363487, low A363486.
The low version is A363941.
For mean instead of median we have A363944, triangle A363946, low A363943.
A061395 give maximum prime index, A055396 minimum.
A112798 lists prime indices, length A001222, sum A056239.
A362611 counts modes in prime indices, triangle A362614.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    merr[y_]:=If[Length[y]==0,0, If[OddQ[Length[y]],y[[(Length[y]+1)/2]],y[[1+Length[y]/2]]]];
    Table[merr[prix[n]],{n,100}]

A238478 Number of partitions of n whose median is a part.

Original entry on oeis.org

1, 2, 2, 4, 5, 8, 11, 17, 22, 32, 43, 59, 78, 105, 136, 181, 233, 302, 386, 496, 626, 796, 999, 1255, 1564, 1951, 2412, 2988, 3674, 4516, 5524, 6753, 8211, 9984, 12086, 14617, 17617, 21211, 25450, 30514, 36475, 43550, 51869, 61707, 73230, 86821, 102706
Offset: 1

Views

Author

Clark Kimberling, Feb 27 2014

Keywords

Comments

Also the number of integer partitions of n with a unique middle part. This means that either the length is odd or the two middle parts are equal. For example, the partition (4,3,2,1) has middle parts {2,3} so is not counted under a(10), but (3,2,2,1) has middle parts {2,2} so is counted under a(8). - Gus Wiseman, May 13 2023

Examples

			a(6) counts these partitions:  6, 411, 33, 321, 3111, 222, 21111, 111111.
		

Crossrefs

For mean instead of median we have A237984, ranks A327473.
The complement is counted by A238479, ranks A362617.
These partitions have ranks A362618.
A000041 counts integer partitions.
A325347 counts partitions with integer median, complement A307683.
A359893/A359901/A359902 count partitions by median.
A359908 ranks partitions with integer median, complement A359912.

Programs

  • Mathematica
    Table[Count[IntegerPartitions[n], p_ /; MemberQ[p, Median[p]]], {n, 40}]

Formula

a(n) + A238479(n) = A000041(n).
For all n, a(n) >= A027193(n) (because when a partition of n has an odd number of parts, its median is simply the part at the middle). - Antti Karttunen, Feb 27 2014
a(n) = A078408(n-1) - A282893(n). - Mathew Englander, May 24 2023

A360244 Number of integer partitions of n where the parts do not have the same median as the distinct parts.

Original entry on oeis.org

0, 0, 0, 0, 1, 3, 3, 9, 11, 17, 23, 37, 42, 68, 87, 110, 153, 209, 261, 352, 444, 573, 750, 949, 1187, 1508, 1909, 2367, 2938, 3662, 4507, 5576, 6826, 8359, 10203, 12372, 15011, 18230, 21996, 26518, 31779, 38219, 45682, 54660, 65112, 77500, 92089, 109285
Offset: 0

Views

Author

Gus Wiseman, Feb 05 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(4) = 1 through a(9) = 17 partitions:
  (211)  (221)   (411)    (322)     (332)      (441)
         (311)   (3111)   (331)     (422)      (522)
         (2111)  (21111)  (511)     (611)      (711)
                          (2221)    (4211)     (3222)
                          (3211)    (5111)     (3321)
                          (4111)    (22211)    (4311)
                          (22111)   (32111)    (5211)
                          (31111)   (41111)    (6111)
                          (211111)  (221111)   (22221)
                                    (311111)   (33111)
                                    (2111111)  (42111)
                                               (51111)
                                               (321111)
                                               (411111)
                                               (2211111)
                                               (3111111)
                                               (21111111)
For example, the partition y = (33111) has median 1, and the distinct parts {1,3} have median 2, so y is counted under a(9).
		

Crossrefs

For mean instead of median: A360242, ranks A360246, complement A360243.
These partitions are ranked by A360248.
The complement is A360245, ranked by A360249.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by number of parts.
A116608 counts partitions by number of distinct parts.
A240219 counts partitions with mean equal to median, ranks A359889.
A325347 counts partitions w/ integer median, strict A359907, ranks A359908.
A359893 and A359901 count partitions by median.
A359894 counts partitions with mean different from median, ranks A359890.
A360071 counts partitions by number of parts and number of distinct parts.

Programs

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

A360550 Numbers > 1 whose distinct prime indices have integer median.

Original entry on oeis.org

2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 16, 17, 19, 20, 21, 22, 23, 25, 27, 29, 30, 31, 32, 34, 37, 39, 40, 41, 42, 43, 44, 46, 47, 49, 50, 53, 55, 57, 59, 60, 61, 62, 63, 64, 66, 67, 68, 70, 71, 73, 78, 79, 80, 81, 82, 83, 84, 85, 87, 88, 89, 90, 91, 92, 94, 97, 100
Offset: 1

Views

Author

Gus Wiseman, Feb 14 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. Distinct prime indices are listed by A304038.
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 900 are {1,1,2,2,3,3}, with distinct parts {1,2,3}, with median 2, so 900 is in the sequence.
The prime indices of 330 are {1,2,3,5},  with distinct parts {1,2,3,5}, with median 5/2, so 330 is not in the sequence.
		

Crossrefs

For mean instead of median we have A326621.
Positions of even terms in A360457.
The complement (without 1) is A360551.
Partitions with these Heinz numbers are counted by A360686.
- For divisors (A063655) we have A139711, complement A139710.
- For prime indices (A360005) we have A359908, complement A359912.
- For distinct prime indices (A360457) we have A360550, complement A360551.
- For distinct prime factors (A360458) we have A360552, complement A100367.
- For prime factors (A360459) we have A359913, complement A072978.
- For prime multiplicities (A360460) we have A360553, complement A360554.
- For 0-prepended differences (A360555) we have A360556, complement A360557.
A112798 lists prime indices, length A001222, sum A056239.
A304038 lists distinct prime indices, length A001221, sum A066328.
A325347 = partitions w/ integer median, complement A307683, strict A359907.
A326619/A326620 gives mean of distinct prime indices.
A359893 and A359901 count partitions by median, odd-length A359902.

Programs

  • Mathematica
    Select[Range[2,100],IntegerQ[Median[PrimePi/@First/@FactorInteger[#]]]&]

A363941 Low median in the multiset of prime indices of n.

Original entry on oeis.org

0, 1, 2, 1, 3, 1, 4, 1, 2, 1, 5, 1, 6, 1, 2, 1, 7, 2, 8, 1, 2, 1, 9, 1, 3, 1, 2, 1, 10, 2, 11, 1, 2, 1, 3, 1, 12, 1, 2, 1, 13, 2, 14, 1, 2, 1, 15, 1, 4, 3, 2, 1, 16, 2, 3, 1, 2, 1, 17, 1, 18, 1, 2, 1, 3, 2, 19, 1, 2, 3, 20, 1, 21, 1, 3, 1, 4, 2, 22, 1, 2, 1
Offset: 1

Views

Author

Gus Wiseman, Jul 01 2023

Keywords

Comments

The low median (see A124943) in a multiset is either the middle part (for odd length), or the least of the two middle parts (for even length).
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 90 are {1,2,2,3}, with low median 2, so a(90) = 2.
The prime indices of 150 are {1,2,3,3}, with low median 2, so a(150) = 2.
		

Crossrefs

Positions of first appearances are 1 and A000040.
The triangle for this statistic (low median) is A124943, high A124944.
Median of prime indices is A360005(n)/2.
For mode instead of median we have A363486, high A363487.
Positions of 1's are A363488.
The high version is A363942.
A067538 counts partitions with integer mean, ranked by A316413.
A112798 lists prime indices, length A001222, sum A056239.
A363943 gives low mean of prime indices, triangle A363945.
A363944 gives high mean of prime indices, triangle A363946.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    mell[y_]:=If[Length[y]==0,0, If[OddQ[Length[y]],y[[(Length[y]+1)/2]],y[[Length[y]/2]]]];
    Table[mell[prix[n]],{n,30}]

A359895 Number of odd-length integer partitions of n whose parts have the same mean as median.

Original entry on oeis.org

0, 1, 1, 2, 1, 2, 3, 2, 1, 5, 5, 2, 5, 2, 8, 18, 1, 2, 19, 2, 24, 41, 20, 2, 9, 44, 31, 94, 102, 2, 125, 2, 1, 206, 68, 365, 382, 2, 98, 433, 155, 2, 716, 2, 1162, 2332, 196, 2, 17, 1108, 563, 1665, 3287, 2, 3906, 5474, 2005, 3083, 509, 2, 9029
Offset: 0

Views

Author

Gus Wiseman, Jan 20 2023

Keywords

Comments

The length and median of such a partition are integers with product n.

Examples

			The a(1) = 1 through a(9) = 5 partitions:
  (1)  (2)  (3)    (4)  (5)      (6)    (7)        (8)  (9)
            (111)       (11111)  (222)  (1111111)       (333)
                                 (321)                  (432)
                                                        (531)
                                                        (111111111)
The a(15) = 18 partitions:
  (15)
  (5,5,5)
  (6,5,4)
  (7,5,3)
  (8,5,2)
  (9,5,1)
  (3,3,3,3,3)
  (4,3,3,3,2)
  (4,4,3,2,2)
  (4,4,3,3,1)
  (5,3,3,2,2)
  (5,3,3,3,1)
  (5,4,3,2,1)
  (5,5,3,1,1)
  (6,3,3,2,1)
  (6,4,3,1,1)
  (7,3,3,1,1)
  (1,1,1,1,1,1,1,1,1,1,1,1,1,1,1)
		

Crossrefs

This is the odd-length case of A240219, complement A359894, strict A359897.
These partitions are ranked by A359891, complement A359892.
The complement is counted by A359896.
The strict case is A359899, complement A359900.
The version for factorizations is A359910.
A000041 counts partitions, strict A000009.
A008284/A058398/A327482 count partitions by mean, ranked by A326567/A326568.
A027193 counts odd-length partitions, strict A067659, ranked by A026424.
A067538 counts ptns with integer mean, strict A102627, ranked by A316413.
A237984 counts ptns containing their mean, strict A240850, ranked by A327473.
A325347 counts ptns with integer median, strict A359907, ranked by A359908.
A359893 and A359901 count partitions by median, odd-length A359902.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n], OddQ[Length[#]]&&Mean[#]==Median[#]&]],{n,0,30}]
  • PARI
    \\ P(n, k, m) is g.f. for k parts of max size m.
    P(n, k, m)={polcoef(1/prod(i=1, m, 1 - y*x^i + O(x*x^n)), k, y)}
    a(n)={if(n==0, 0, sumdiv(n, d, if(d%2, my(m=n/d, h=d\2, r=n-m*(h+1)+h); polcoef(P(r, h, m)*P(r, h, r), r))))} \\ Andrew Howroyd, Jan 21 2023

Formula

a(p) = 2 for prime p. - Andrew Howroyd, Jan 21 2023
Previous Showing 21-30 of 80 results. Next