A067538 -id:A067538 - cp's OEIS frontend

A360069 Number of integer partitions of n whose multiset of multiplicities has integer mean.

0, 1, 2, 3, 4, 5, 9, 9, 13, 16, 25, 26, 39, 42, 62, 67, 95, 107, 147, 168, 225, 245, 327, 381, 471, 565, 703, 823, 1038, 1208, 1443, 1743, 2088, 2439, 2937, 3476, 4163, 4921, 5799, 6825, 8109, 9527, 11143, 13122, 15402, 17887, 20995, 24506, 28546, 33234, 38661

Offset: 0

Gus Wiseman, Jan 27 2023

nonn

			The a(1) = 1 through a(8) = 13 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (21)   (22)    (32)     (33)      (43)       (44)
             (111)  (31)    (41)     (42)      (52)       (53)
                    (1111)  (2111)   (51)      (61)       (62)
                            (11111)  (222)     (421)      (71)
                                     (321)     (2221)     (431)
                                     (2211)    (4111)     (521)
                                     (3111)    (211111)   (2222)
                                     (111111)  (1111111)  (3311)
                                                          (5111)
                                                          (221111)
                                                          (311111)
                                                          (11111111)
For example,  the partition (3,2,1,1,1,1) has multiplicities (1,1,4) with mean 2, so is counted under a(9). On the other hand, the partition (3,2,2,1,1) has multiplicities (1,2,2) with mean 5/3, so is not counted under a(9).

These partitions are ranked by A067340 (prime signature has integer mean).
Parts instead of multiplicities: A067538, strict A102627, ranked by A316413.
The case where the parts have integer mean also is ranked by A359905.
A000041 counts integer partitions, strict A000009.
A051293 counts subsets with integer mean, median A000975.
A058398 counts partitions by mean, see also A008284, A327482.
A088529/A088530 gives mean of prime signature (A124010).
A326622 counts factorizations with integer mean, strict A328966.
Cf. A082550, A240219, A316313, A325347, A326669, A327475, A349156, A360068.

Table[Length[Select[IntegerPartitions[n], IntegerQ[Mean[Length/@Split[#]]]&]],{n,0,30}]

A360246 Numbers for which the prime indices do not have the same mean as the distinct prime indices.

Original entry on oeis.org

12, 18, 20, 24, 28, 40, 44, 45, 48, 50, 52, 54, 56, 60, 63, 68, 72, 75, 76, 80, 84, 88, 92, 96, 98, 99, 104, 108, 112, 116, 117, 120, 124, 126, 132, 135, 136, 140, 144, 147, 148, 150, 152, 153, 156, 160, 162, 164, 168, 171, 172, 175, 176, 180, 184, 188, 189

Offset: 1

Gus Wiseman, Feb 07 2023

nonn

First differs from A242416 in having 126.
Contains no squarefree numbers or perfect powers.
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 terms together with their prime indices begin:
   12: {1,1,2}
   18: {1,2,2}
   20: {1,1,3}
   24: {1,1,1,2}
   28: {1,1,4}
   40: {1,1,1,3}
   44: {1,1,5}
   45: {2,2,3}
   48: {1,1,1,1,2}
   50: {1,3,3}
   52: {1,1,6}
   54: {1,2,2,2}
   56: {1,1,1,4}
   60: {1,1,2,3}
   63: {2,2,4}
   68: {1,1,7}
   72: {1,1,1,2,2}
The prime indices of 126 are {1,2,2,4} with mean 9/4 and distinct prime indices {1,2,4} with mean 7/3, so 126 is in the sequence.

Signature instead of parts: complement A324570, counted by A114638.
Signature instead of distinct parts: complement A359903, counted by A360068.
These partitions are counted by A360242.
The complement is A360247, counted by A360243.
For median we have A360248, counted by A360244 (complement A360245).
Union of A360252 and A360253, counted by A360250 and A360251.
A058398 counts partitions by mean, also A327482.
A088529/A088530 gives mean of prime signature (A124010).
A112798 lists prime indices, length A001222, sum A056239.
A316413 = numbers whose prime indices have integer mean, distinct A326621.
A326567/A326568 gives mean of prime indices.
A326619/A326620 gives mean of distinct prime indices.
Cf. A000975, A051293, A067340, A067538, A360005, A360241.

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

A360247 Numbers for which the prime indices have the same mean as the distinct prime indices.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 21, 22, 23, 25, 26, 27, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 46, 47, 49, 51, 53, 55, 57, 58, 59, 61, 62, 64, 65, 66, 67, 69, 70, 71, 73, 74, 77, 78, 79, 81, 82, 83, 85, 86, 87, 89, 90, 91, 93, 94, 95, 97, 100, 101, 102, 103, 105, 106, 107, 109, 110, 111, 113, 114, 115, 118, 119, 121, 122, 123, 125, 127, 128, 129, 130

Offset: 1

Gus Wiseman, Feb 07 2023

nonn

First differs from A072774 in having 90.
First differs from A242414 in lacking 126.
Includes all squarefree numbers and perfect powers.
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 prime indices of 900 are {3,3,2,2,1,1} with mean 2, and the distinct prime indices are {1,2,3} also with mean 2, so 900 is in the sequence.

Signature instead of parts: A324570, counted by A114638.
Signature instead of distinct parts: A359903, counted by A360068.
These partitions are counted by A360243.
The complement is A360246, counted by A360242.
For median instead of mean the complement is A360248, counted by A360244.
For median instead of mean we have A360249, counted by A360245.
For greater instead of equal mean we have A360252, counted by A360250.
For lesser instead of equal mean we have A360253, counted by A360251.
A008284 counts partitions by number of parts, distinct A116608.
A058398 counts partitions by mean, also A327482.
A088529/A088530 gives mean of prime signature (A124010).
A112798 lists prime indices, length A001222, sum A056239.
A316413 = numbers whose prime indices have integer mean, distinct A326621.
A326567/A326568 gives mean of prime indices.
A326619/A326620 gives mean of distinct prime indices.
Cf. A000975, A051293, A067340, A067538, A360005, A360241.

isA360247 := proc(n)
    local ifs,pidx,pe,meanAll,meanDist ;
    if n = 1 then
        return true ;
    end if ;
    ifs := ifactors(n)[2] ;
    # list of prime indices with multiplicity
    pidx := [] ;
    for pe in ifs do
        [numtheory[pi](op(1,pe)),op(2,pe)] ;
        pidx := [op(pidx),%] ;
    end do:
    meanAll := add(op(1,pe)*op(2,pe),pe=pidx) / add(op(2,pe),pe=pidx) ;
    meanDist := add(op(1,pe),pe=pidx) / nops(pidx) ;
    if meanAll = meanDist then
        true;
    else
        false;
    end if;
end proc:
for n from 1 to 130 do
    if isA360247(n) then
        printf("%d,",n) ;
    end if;
end do: # R. J. Mathar, May 22 2023

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

A361859 Number of integer partitions of n such that the maximum is greater than or equal to twice the median.

Original entry on oeis.org

0, 0, 0, 1, 2, 3, 7, 10, 15, 23, 34, 46, 67, 90, 121, 164, 219, 285, 375, 483, 622, 799, 1017, 1284, 1621, 2033, 2537, 3158, 3915, 4832, 5953, 7303, 8930, 10896, 13248, 16071, 19451, 23482, 28272, 33977, 40736, 48741, 58201, 69367, 82506, 97986, 116139

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(9) = 15 partitions:
  (211)  (311)   (411)    (421)     (422)      (522)
         (2111)  (3111)   (511)     (521)      (621)
                 (21111)  (3211)    (611)      (711)
                          (4111)    (4211)     (4221)
                          (22111)   (5111)     (4311)
                          (31111)   (32111)    (5211)
                          (211111)  (41111)    (6111)
                                    (221111)   (33111)
                                    (311111)   (42111)
                                    (2111111)  (51111)
                                               (321111)
                                               (411111)
                                               (2211111)
                                               (3111111)
                                               (21111111)
The partition y = (5,2,2,1) has maximum 5 and median 2, and 5 >= 2*2, so y is counted under a(10).

For length instead of median we have A237752.
For minimum instead of median we have A237821.
Reversing the inequality gives A361848.
The equal case is A361849, ranks A361856.
The unequal case is A361857, ranks A361867.
The complement is counted by A361858.
These partitions have ranks A361868.
For mean instead of median we have A361906.
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.
Cf. A008284, A027193, A067538, A237755, A237820, A237824, A240219, A359907, A361851, A361860, A361907.

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

A363950 Numbers whose prime indices have rounded-up mean 2.

Original entry on oeis.org

3, 6, 9, 10, 12, 18, 20, 24, 27, 28, 30, 36, 40, 48, 54, 56, 60, 72, 80, 81, 84, 88, 90, 96, 100, 108, 112, 120, 144, 160, 162, 168, 176, 180, 192, 200, 208, 216, 224, 240, 243, 252, 264, 270, 280, 288, 300, 320, 324, 336, 352, 360, 384, 400, 416, 432, 448

Offset: 1

Gus Wiseman, Jul 05 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 terms together with their prime indices begin:
     3: {2}
     6: {1,2}
     9: {2,2}
    10: {1,3}
    12: {1,1,2}
    18: {1,2,2}
    20: {1,1,3}
    24: {1,1,1,2}
    27: {2,2,2}
    28: {1,1,4}
    30: {1,2,3}
    36: {1,1,2,2}
    40: {1,1,1,3}
    48: {1,1,1,1,2}
    54: {1,2,2,2}
    56: {1,1,1,4}
    60: {1,1,2,3}
    72: {1,1,1,2,2}
    80: {1,1,1,1,3}
    81: {2,2,2,2}

For mean 1 we have A000079 except 1.
Partitions of this type are counted by A026905 redoubled.
Equals the complement of A000079 in A344296.
Positions of 2's in A363944 (counted by column 2 of A363946).
For rounded mean 1 we have A363948, counted by A363947.
For rounded-down mean 1 we have A363949, counted by A025065.
The rounded-down or low version is A363954, counted by A363745.
A316413 ranks partitions with integer mean, counted by A067538.
A112798 lists prime indices, length A001222, sum A056239.
A326567/A326568 gives mean of prime indices.
A363941 gives low median of prime indices, triangle A124943.
A363942 gives high median of prime indices, triangle A124944.
Cf. A327473, A327476, A359889, A360005, A360013, A360015, A363727, A363943.

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

A298423 Number of integer partitions of n such that the predecessor of each part is divisible by the number of parts.

Original entry on oeis.org

1, 1, 2, 2, 3, 2, 5, 2, 5, 4, 6, 2, 11, 2, 7, 8, 10, 2, 15, 2, 16, 11, 9, 2, 28, 7, 10, 14, 22, 2, 37, 2, 25, 18, 12, 17, 55, 2, 13, 23, 52, 2, 55, 2, 40, 51, 15, 2, 95, 13, 44, 34, 53, 2, 79, 37, 85, 41, 18, 2, 185, 2, 19, 80, 91, 54, 112, 2, 87, 56, 122, 2

Offset: 0

Gus Wiseman, Jan 19 2018

nonn

Note that n is automatically divisible by the number of parts.

			The a(9) = 4 partitions: (9), (441), (711), (111111111).

Cf. A000005, A000041, A067538, A143773, A280954, A298422, A298424, A298426.

Table[Length[Select[IntegerPartitions[n],Function[ptn,And@@(Divisible[#-1,Length[ptn]]&/@ptn)]]],{n,60}]

G.f.: Sum_{k>=0} x^k/Product_{i=1..k} (1-x^(k*i)).

A326847 Heinz numbers of integer partitions of m >= 0 using divisors of m whose length also divides m.

Original entry on oeis.org

2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23, 25, 27, 29, 30, 31, 32, 37, 41, 43, 47, 49, 53, 59, 61, 64, 67, 71, 73, 79, 81, 83, 84, 89, 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

Offset: 1

Gus Wiseman, Jul 26 2019

nonn

First differs from A071139, A089352 and A086486 in lacking 60. First differs from A326837 in lacking 268.
The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).
The enumeration of these partitions by sum is given by A326842.

			The sequence of terms together with their prime indices begins:
   2: {1}
   3: {2}
   4: {1,1}
   5: {3}
   7: {4}
   8: {1,1,1}
   9: {2,2}
  11: {5}
  13: {6}
  16: {1,1,1,1}
  17: {7}
  19: {8}
  23: {9}
  25: {3,3}
  27: {2,2,2}
  29: {10}
  30: {1,2,3}
  31: {11}
  32: {1,1,1,1,1}
  37: {12}

R. J. Mathar, Table of n, a(n) for n = 1..489

Intersection of A326841 and A316413.

Cf. A001222, A018818, A056239, A067538, A112798, A316413, A326836, A326842.

isA326847 := proc(n)
    psigsu := A056239(n) ;
    for ifs in ifactors(n)[2] do
        p := op(1,ifs) ;
        psig := numtheory[pi](p) ;
        if modp(psigsu,psig) <> 0 then
            return false;
        end if;
    end do:
    psigle := numtheory[bigomega](n) ;
    if modp(psigsu,psigle) = 0 then
        true;
    else
        false;
    end if;
end proc:
n := 1:
for i from 2 to 3000 do
    if isA326847(i) then
        printf("%d %d\n",n,i);
        n := n+1 ;
    end if;
end do: # R. J. Mathar, Aug 09 2019

Select[Range[2,100],With[{y=Flatten[Cases[FactorInteger[#],{p_,k_}:>Table[PrimePi[p],{k}]]]},Divisible[Total[y],Length[y]]&&And@@IntegerQ/@(Total[y]/y)]&]

Intersection of A326841 and A316413.

A340606 Numbers whose prime indices (A112798) are all divisors of the number of prime factors (A001222).

Original entry on oeis.org

1, 2, 4, 6, 8, 9, 16, 20, 24, 32, 36, 50, 54, 56, 64, 81, 84, 96, 125, 126, 128, 144, 160, 176, 189, 196, 216, 240, 256, 294, 324, 360, 384, 400, 416, 441, 486, 512, 540, 576, 600, 624, 686, 729, 810, 864, 896, 900, 936, 968, 1000, 1024, 1029, 1040, 1088, 1215

Offset: 1

Gus Wiseman, Jan 24 2021

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 sequence of terms together with their prime indices begins:
   1: {}
   2: {1}
   4: {1,1}
   6: {1,2}
   8: {1,1,1}
   9: {2,2}
  16: {1,1,1,1}
  20: {1,1,3}
  24: {1,1,1,2}
  32: {1,1,1,1,1}
  36: {1,1,2,2}
  50: {1,3,3}
  54: {1,2,2,2}
  56: {1,1,1,4}
  64: {1,1,1,1,1,1}
  81: {2,2,2,2}
  84: {1,1,2,4}
  96: {1,1,1,1,1,2}

Note: Heinz numbers are given in parentheses below.
The reciprocal version is A143773 (A316428).
These partitions are counted by A340693.
A120383 lists numbers divisible by all of their prime indices.
A324850 lists numbers divisible by the product of their prime indices.
A003963 multiplies together the prime indices of n.
A018818 counts partitions of n into divisors of n (A326841).
A047993 counts balanced partitions (A106529).
A067538 counts partitions of n whose length divides n (A316413).
A056239 adds up the prime indices of n.
A061395 selects the maximum prime index.
A067538 counts partitions of n whose maximum divides n (A326836).
A072233 counts partitions by sum and length.
A112798 lists the prime indices of each positive integer.
A168659 = partitions whose length is divisible by their maximum (A340609).
A168659 = partitions whose maximum is divisible by their length (A340610).
A289509 lists numbers with relatively prime prime indices.
A326842 = partitions of n whose length and parts all divide n (A326847).
A326843 = partitions of n whose length and maximum both divide n (A326837).
A340852 have a factorization with factors dividing length.
Cf. A000720, A001222, A006141, A067539, A200750, A298423, A324925, A326149/A326155, A340608, A340827.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],And@@IntegerQ/@(PrimeOmega[#]/primeMS[#])&]

A340830 Number of strict integer partitions of n such that every part is a multiple of the number of parts.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 2, 1, 3, 1, 3, 1, 4, 1, 4, 1, 6, 1, 5, 2, 6, 1, 8, 1, 7, 4, 7, 1, 12, 1, 8, 6, 9, 1, 16, 1, 10, 9, 11, 1, 21, 1, 12, 13, 12, 1, 28, 1, 13, 17, 16, 1, 33, 1, 19, 22, 15, 1, 45, 1, 16, 28, 25, 1, 47, 1, 28, 34, 18

Offset: 1

Gus Wiseman, Feb 02 2021

nonn

			The a(n) partitions for n = 1, 6, 10, 14, 18, 20, 24, 26, 30:
  1   6     10    14     18      20     24       26      30
      4,2   6,4   8,6    10,8    12,8   16,8     18,8    22,8
            8,2   10,4   12,6    14,6   18,6     20,6    24,6
                  12,2   14,4    16,4   20,4     22,4    26,4
                         16,2    18,2   22,2     24,2    28,2
                         9,6,3          14,10    14,12   16,14
                                        12,9,3   16,10   18,12
                                        15,6,3           20,10
                                                         15,9,6
                                                         18,9,3
                                                         21,6,3
                                                         15,12,3

Note: A-numbers of Heinz-number sequences are in parentheses below.
The non-strict case is A143773 (A316428).
The case where length divides sum also is A340827.
The version for factorizations is A340851.
Factorization of this type are counted by A340853.
A018818 counts partitions into divisors (A326841).
A047993 counts balanced partitions (A106529).
A067538 counts partitions whose length/max divide sum (A316413/A326836).
A072233 counts partitions by sum and length, with strict case A008289.
A102627 counts strict partitions whose length divides sum.
A326850 counts strict partitions whose maximum part divides sum.
A326851 counts strict partitions with length and maximum dividing sum.
A340828 counts strict partitions with length divisible by maximum.
A340829 counts strict partitions with Heinz number divisible by sum.
Cf. A114638, A168659, A326641, A326843 (A326837), A326849, A326852 (A326838), A330950 (A324851), A340852.

Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&And@@IntegerQ/@(#/Length[#])&]],{n,30}]

a(n) = Sum_{d|n} A008289(n/d, d).

A359913 Numbers whose multiset of prime factors has integer median.

Original entry on oeis.org

2, 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, 18, 19, 20, 21, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 37, 39, 40, 41, 42, 43, 44, 45, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 59, 61, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 75, 76, 77, 78, 79, 80, 81

Offset: 1

Gus Wiseman, Jan 25 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 terms together with their prime factors begin:
   2: {2}
   3: {3}
   4: {2,2}
   5: {5}
   7: {7}
   8: {2,2,2}
   9: {3,3}
  11: {11}
  12: {2,2,3}
  13: {13}
  15: {3,5}
  16: {2,2,2,2}
  17: {17}
  18: {2,3,3}
  19: {19}
  20: {2,2,5}
  21: {3,7}
  23: {23}
  24: {2,2,2,3}

Prime factors are listed by A027746.
The complement is A072978, for prime indices A359912.
For mean instead of median we have A078175, for prime indices A316413.
For prime indices instead of factors we have A359908, counted by A325347.
Positions of even terms in A360005.
A067340 lists numbers whose prime signature has integer mean.
A112798 lists prime indices, length A001222, sum A056239.
A325347 counts partitions with integer median, strict A359907.
A326567/A326568 gives the mean of prime indices, conjugate A326839/A326840.
A359893 and A359901 count partitions by median, odd-length A359902.
Cf. A067538, A175352, A348551, A359890, A359905, A360007, A360006, A360069.

Select[Range[2,100],IntegerQ[Median[Flatten[ConstantArray@@@FactorInteger[#]]]]&]

cp's OEIS Frontend

A360069 Number of integer partitions of n whose multiset of multiplicities has integer mean.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A360246 Numbers for which the prime indices do not have the same mean as the distinct prime indices.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A360247 Numbers for which the prime indices have the same mean as the distinct prime indices.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

A361859 Number of integer partitions of n such that the maximum is greater than or equal to twice the median.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A363950 Numbers whose prime indices have rounded-up mean 2.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A298423 Number of integer partitions of n such that the predecessor of each part is divisible by the number of parts.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A326847 Heinz numbers of integer partitions of m >= 0 using divisors of m whose length also divides m.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A340606 Numbers whose prime indices (A112798) are all divisors of the number of prime factors (A001222).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A340830 Number of strict integer partitions of n such that every part is a multiple of the number of parts.

Views

Author