A359902 -id:A359902 - cp's OEIS frontend

A360006 Least positive integer whose prime indices have median n/2. a(1) = 1.

1, 2, 6, 3, 14, 5, 26, 7, 38, 11, 58, 13, 74, 17, 86, 19, 106, 23, 122, 29, 142, 31, 158, 37, 178, 41, 202, 43, 214, 47, 226, 53, 262, 59, 278, 61, 302, 67, 326, 71, 346, 73, 362, 79, 386, 83, 398, 89, 446, 97, 458, 101, 478, 103, 502, 107, 526, 109, 542, 113

Offset: 1

Gus Wiseman, Jan 24 2023

nonn

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).

Position of first appearance of n in A360005.
The sorted version is A360007, for mean A360008.
A112798 lists prime indices, length A001222, sum A056239.
A316413 lists numbers whose prime indices have integer mean.
A325347 = partitions w/ integer median, strict A359907, complement A307683.
A326567/A326568 gives mean of prime indices.
A359893 counts partitions by median, cf. A359901, A359902.
A359908 = numbers w/ integer median of prime indices, complement A359912.
Cf. A026424, A359889, A359890, A360009.

nn=100;
prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
seq=Table[If[n==1,1,2*Median[prix[n]]],{n,nn}];
Table[Position[seq,k][[1,1]],{k,Count[Differences[Union[seq]],1]}]

Consists of 1 followed by A000040 interleaved with 2*A031215.

A238479 Number of partitions of n whose median is not a part.

Original entry on oeis.org

0, 0, 1, 1, 2, 3, 4, 5, 8, 10, 13, 18, 23, 30, 40, 50, 64, 83, 104, 131, 166, 206, 256, 320, 394, 485, 598, 730, 891, 1088, 1318, 1596, 1932, 2326, 2797, 3360, 4020, 4804, 5735, 6824, 8108, 9624, 11392, 13468, 15904, 18737, 22048, 25914, 30400, 35619, 41686

Offset: 1

Clark Kimberling, Feb 27 2014

Also, the number of partitions p of n such that (1/2)*max(p) is a part of p.

Also the number of even-length integer partitions of n with distinct middle parts. For example, the partition (4,3,2,1) has middle parts {2,3} so is counted under a(10), but (3,2,2,1) has middle parts {2,2} so is not counted under a(8). - Gus Wiseman, May 13 2023

			a(6) counts these partitions:  51, 42, 2211 which all have an even number of parts, and their medians 3, 3 and 1.5 are not present. Note that the partitions 33 and 3111, although having an even number of parts, are not included in the count of a(6), but instead in that of A238478(6), as their medians, 3 for the former and 1 for the latter, are present in those partitions.

A. Blecher and A. Knopfmacher, Fixed points and matching points in partitions, Ramanujan J. 58 (2022), 23-41.

The complement is A238478, ranks A362618.
For mean instead of median we have A327472, complement A237984.
These partitions have ranks A362617.
A000041 counts integer partitions, even-length A027187.
A325347 counts partitions with integer median, complement A307683.
A359893/A359901/A359902 count partitions by median.
A359908 ranks partitions with integer median, complement A359912.
Cf. A002865, A008284, A053263, A238480, A238481, A240219, A359907, A360686, A360687, A360952.

Table[Count[IntegerPartitions[n], p_ /; !MemberQ[p, Median[p]]], {n, 40}]
(* also *)
Table[Count[IntegerPartitions[n], p_ /; MemberQ[p, Max[p]/2]], {n, 50}]

my(q='q+O('q^50)); concat([0,0], Vec(sum(n=1,17,q^(3*n)/prod(k=1,2*n,1-q^k)))) \\ David Radcliffe, Jun 25 2025

from sympy.utilities.iterables import partitions
def A238479(n): return sum(1 for p in partitions(n) if (m:=max(p,default=0))&1^1 and m>>1 in p) # Chai Wah Wu, Sep 21 2023

a(n) = A000041(n) - A238478(n).
For all n, A027187(n) >= a(n). [Because when a partition of n has an odd number of parts, then it is not counted by this sequence (cf. A238478) and also some of the partitions with an even number of parts might be excluded here. Cf. Examples.] - Antti Karttunen, Feb 27 2014
From Jeremy Lovejoy, Sep 29 2022: (Start)
G.f.: Sum_{n>=1} q^(3*n)/Product_{k=1..2*n} (1-q^k).
a(n) ~ Pi/(2^(17/4)*3^(3/4)*n^(5/4))*exp(Pi*sqrt(2*n/3)). Proved by Blecher and Knopfmacher. (End)
a(n) = A087897(2*n) = A035294(n) - A078408(n-1). - Mathew Englander, May 20 2023

A361849 Number of integer partitions of n such that the maximum is twice the median.

Original entry on oeis.org

0, 0, 0, 1, 1, 1, 4, 3, 4, 7, 9, 9, 15, 16, 20, 26, 34, 37, 50, 55, 68, 86, 103, 117, 145, 168, 201, 236, 282, 324, 391, 449, 525, 612, 712, 818, 962, 1106, 1278, 1470, 1698, 1939, 2238, 2550, 2924, 3343, 3824, 4341, 4963, 5627, 6399, 7256, 8231, 9300

Offset: 1

Gus Wiseman, Apr 02 2023

nonn

The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).

			The a(4) = 1 through a(11) = 9 partitions:
  211  2111  21111  421     422      4221      631        632
                    3211    221111   4311      4222       5321
                    22111   2111111  2211111   42211      5411
                    211111           21111111  322111     42221
                                               2221111    43211
                                               22111111   332111
                                               211111111  22211111
                                                          221111111
                                                          2111111111
For example, the partition (3,2,1,1) has maximum 3 and median 3/2, so is counted under a(7).

For minimum instead of median we have A118096.
For length instead of median we have A237753.
This is the equal case of A361848.
For mean instead of median we have A361853.
These partitions have ranks A361856.
For "greater" instead of "equal" we have A361857, allowing equality A361859.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by length, A058398 by mean.
A325347 counts partitions with integer median, complement A307683.
A359893 and A359901 count partitions by median, odd-length A359902.
A360005 gives twice median of prime indices, distinct A360457.
A361860 counts partitions with minimum equal to median.
Cf. A013580, A027193, A053263, A061395, A067659, A111907, A116608, A237755, A240219, A361851.

Table[Length[Select[IntegerPartitions[n],Max@@#==2*Median[#]&]],{n,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

Gus Wiseman, Feb 14 2023

nonn

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.

			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.

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.
Cf. A000975, A026424, A359907, A359908, A359912, A360550.

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

Gus Wiseman, Feb 16 2023

nonn

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).

			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.

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.
Cf. A000975, A026424, A078175, A316413, A360009, A360558, A360669, A360681.

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

A237363 Number of partitions of n for which 2*(number of distinct parts) <= (number of parts).

Original entry on oeis.org

1, 0, 1, 1, 2, 2, 6, 6, 10, 13, 20, 26, 39, 50, 71, 87, 121, 156, 208, 265, 348, 440, 566, 712, 906, 1131, 1424, 1766, 2224, 2738, 3390, 4168, 5130, 6266, 7664, 9312, 11332, 13723, 16603, 20004, 24112, 28942, 34708, 41522, 49612, 59031, 70308, 83479, 98992

Offset: 0

Clark Kimberling, Feb 06 2014

nonn

a(n) + A237365(n) = A000041(n).

Also the number of integer partitions of n whose median difference is 0. For example, the partition (2,2,2,1,1) is counted because its multiset of differences {0,0,0,1} has median 0. - Gus Wiseman, Mar 18 2023

			Among the 22 partitions of 8, these qualify:  [5,1,1,1], [4,4], [4,1,1,1,1], [3,3,1,1], [3,1,1,1,1,1], [2,2,2,2], [2,2,2,1,1], [2,2,1,1,1,1], [2,1,1,1,1,1,1], [1,1,1,1,1,1,1,1], and the remaining 12 do not, so that a(8) = 10.

Alois P. Heinz, Table of n, a(n) for n = 0..800

These partitions have ranks A361204.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by number of parts, reverse A058398.
A116608 counts partitions by number of distinct parts.
A359893 and A359901 count partitions by median, odd-length A359902.
Comparing twice the number of distinct parts to the number of parts:
              less: A360254, ranks A360558
             equal: A239959, ranks A067801
           greater: A237365, ranks A361393
     less or equal: A237363, ranks A361204
  greater or equal: A361394, ranks A361395
Cf. A000975, A027193, A114638, A240219, A325347, A360005, A360244.

z = 50; t = Map[Length[Select[IntegerPartitions[#], 2*Length[DeleteDuplicates[#]] <= Length[#] &]] &, Range[z]] (*A237363*)
Table[PartitionsP[n] - t[[n]], {n, 1, z}] (*A237365*) (* Peter J. C. Moses, Feb 06 2014 *)
Table[Length[Select[IntegerPartitions[n],Median[Differences[#]]==0&]],{n,0,30}] (* Gus Wiseman, Mar 18 2023 *)

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

Gus Wiseman, Jan 24 2023

nonn

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).

			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}

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.
Cf. A026424, A327473, A359889, A359890, A359903, A359905, A360006.

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

Intersection of A316413 and A359908.

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

Clark Kimberling, Feb 27 2014

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

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

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.
Cf. A002865, A008284, A053263, A238480, A240219, A327472, A359907, A360686, A360687, A362608.

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

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

Gus Wiseman, Feb 05 2023

nonn

The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).

			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).

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.
Cf. A000975, A027193, A067659, A326619/A326620, A326621, A359902, A360068, A360241, A360250, A360251.

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

Gus Wiseman, Feb 14 2023

nonn

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).

			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.

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.
Cf. A000975, A026424, A316413, A360006, A360009, A360248, A360453.

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

cp's OEIS Frontend

A360006 Least positive integer whose prime indices have median n/2. a(1) = 1.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

Formula

A238479 Number of partitions of n whose median is not a part.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A361849 Number of integer partitions of n such that the maximum is twice the median.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A237363 Number of partitions of n for which 2*(number of distinct parts) <= (number of parts).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula