A348551 -id:A348551 - cp's OEIS frontend

A361655 Number of even-length integer partitions of 2n with integer mean.

0, 1, 3, 4, 10, 6, 33, 8, 65, 68, 117, 12, 583, 14, 319, 1078, 1416, 18, 3341, 20, 8035, 5799, 1657, 24, 36708, 16954, 3496, 24553, 68528, 30, 192180, 32, 178802, 91561, 14625, 485598, 955142, 38, 29223, 316085, 2622697, 42, 3528870, 44, 2443527, 5740043

Offset: 0

Gus Wiseman, Mar 23 2023

nonn

			The a(0) = 0 through a(5) = 6 partitions:
  .  (11)  (22)    (33)      (44)        (55)
           (31)    (42)      (53)        (64)
           (1111)  (51)      (62)        (73)
                   (111111)  (71)        (82)
                             (2222)      (91)
                             (3221)      (1111111111)
                             (3311)
                             (4211)
                             (5111)
                             (11111111)
For example, the partition (4,2,1,1) has length 4 and mean 2, so is counted under a(4).

Andrew Howroyd, Table of n, a(n) for n = 0..1000

Even-length partitions are counted by A027187, bisection A236913.
Including odd-length partitions gives A067538 bisected, ranks A316413.
For median instead of mean we have A361653.
The odd-length version is counted by A361656.
A000041 counts integer partitions, strict A000009.
A051293 counts subsets with integer mean, median A000975.
A058398 counts partitions by mean, see also A008284, A327482.
A325347 counts partitions with integer median, complement A307683.
A326567/A326568 gives mean of prime indices.
A326622 counts factorizations with integer mean.
Cf. A000016, A027193, A067659, A082550, A102627, A237984, A240219, A327475, A348551, A359893.

Table[Length[Select[IntegerPartitions[2n], EvenQ[Length[#]]&&IntegerQ[Mean[#]]&]],{n,0,15}]

a(n)=if(n==0, 0, sumdiv(n, d, polcoef(1/prod(k=1, 2*d, 1 - x^k + O(x*x^(2*(n-d)))), 2*(n-d)))) \\ Andrew Howroyd, Mar 24 2023

Terms a(36) and beyond from Andrew Howroyd, Mar 24 2023

A348384 Heinz numbers of integer partitions whose length is 2/3 their sum.

Original entry on oeis.org

1, 6, 36, 40, 216, 224, 240, 1296, 1344, 1408, 1440, 1600, 6656, 7776, 8064, 8448, 8640, 8960, 9600, 34816, 39936, 46656, 48384, 50176, 50688, 51840, 53760, 56320, 57600, 64000, 155648, 208896, 239616, 266240, 279936, 290304, 301056, 304128, 311040, 315392

Offset: 1

Gus Wiseman, Nov 13 2021

nonn

The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), so these are numbers whose sum of prime indices is 3/2 their number. Counting the partitions with these Heinz numbers gives A035377(n) = A000041(n/3) if n is a multiple of 3, otherwise 0.

			The terms and their prime indices begin:
     1: {}
     6: {1,2}
    36: {1,1,2,2}
    40: {1,1,1,3}
   216: {1,1,1,2,2,2}
   224: {1,1,1,1,1,4}
   240: {1,1,1,1,2,3}
  1296: {1,1,1,1,2,2,2,2}
  1344: {1,1,1,1,1,1,2,4}
  1408: {1,1,1,1,1,1,1,5}
  1440: {1,1,1,1,1,2,2,3}
  1600: {1,1,1,1,1,1,3,3}
  6656: {1,1,1,1,1,1,1,1,1,6}
  7776: {1,1,1,1,1,2,2,2,2,2}

David A. Corneth, Table of n, a(n) for n = 1..10000

These partitions are counted by A035377.
Rounding down gives A348550 or A347452, counted by A108711 or A119620.
A000041 counts integer partitions.
A001222 counts prime factors with multiplicity.
A056239 adds up prime indices, row sums of A112798.
A316524 gives the alternating sum of prime indices (reverse: A344616).
A344606 counts alternating permutations of prime factors.
Cf. A000070, A000097, A028260, A028982, A032766, A236914, A316413, A347457, A348551.

Select[Range[1000],2*Total[Cases[FactorInteger[#],{p_,k_}:>k*PrimePi[p]]]==3*PrimeOmega[#]&]

A056239(n) = { my(f); if(1==n, 0, f=factor(n); sum(i=1, #f~, f[i, 2] * primepi(f[i, 1]))); }
isA348384(n) = (A056239(n)==(3/2)*bigomega(n)); \\ Antti Karttunen, Nov 22 2021

The sequence contains n iff A056239(n) = 3*A001222(n)/2. Here, A056239 adds up prime indices, while A001222 counts them with multiplicity.

Intersection of A028260 and A347452.

A361391 Number of strict integer partitions of n with non-integer mean.

Original entry on oeis.org

1, 0, 0, 1, 0, 2, 0, 4, 2, 4, 5, 11, 0, 17, 15, 13, 15, 37, 18, 53, 24, 48, 78, 103, 23, 111, 152, 143, 123, 255, 110, 339, 238, 372, 495, 377, 243, 759, 845, 873, 414, 1259, 842, 1609, 1383, 1225, 2281, 2589, 1285, 2827, 2518, 3904, 3836, 5119, 3715, 4630

Offset: 0

Gus Wiseman, Mar 11 2023

nonn

Are 1, 2, 4, 6, 12 the only zeros?

			The a(3) = 1 through a(11) = 11 partitions:
  {2,1}  .  {3,2}  .  {4,3}    {4,3,1}  {5,4}  {5,3,2}    {6,5}
            {4,1}     {5,2}    {5,2,1}  {6,3}  {5,4,1}    {7,4}
                      {6,1}             {7,2}  {6,3,1}    {8,3}
                      {4,2,1}           {8,1}  {7,2,1}    {9,2}
                                               {4,3,2,1}  {10,1}
                                                          {5,4,2}
                                                          {6,3,2}
                                                          {6,4,1}
                                                          {7,3,1}
                                                          {8,2,1}
                                                          {5,3,2,1}

The strict complement is counted by A102627.
The non-strict version is ranked by A348551, complement A316413.
The non-strict version is counted by A349156, complement A067538.
For median instead of mean we have A360952, complement A359907.
A000041 counts partitions, strict A000009.
A008284/A058398/A327482 count partitions by mean.
A307683 counts partitions with non-integer median, ranks A359912.
A325347 counts partitions with integer median, ranks A359908.
A326567/A326568 give the mean of prime indices, conjugate A326839/A326840.
A327472 counts partitions not containing their mean, complement of A237984.
A327475 counts subsets with integer mean.
Cf. A051293, A082550, A143773, A175397, A175761, A240219, A240850, A326027, A326641, A326849, A359897.

a:= proc(m) option remember; local b; b:=
      proc(n, i, t) option remember; `if`(i*(i+1)/2Alois P. Heinz, Mar 16 2023

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

a(31)-a(55) from Alois P. Heinz, Mar 16 2023

A361656 Number of odd-length integer partitions of n with integer mean.

Original entry on oeis.org

0, 1, 1, 2, 1, 2, 4, 2, 1, 9, 8, 2, 13, 2, 16, 51, 1, 2, 58, 2, 85, 144, 57, 2, 49, 194, 102, 381, 437, 2, 629, 2, 1, 956, 298, 2043, 1954, 2, 491, 2293, 1116, 2, 4479, 2, 6752, 14671, 1256, 2, 193, 8035, 4570, 11614, 22143, 2, 28585, 39810, 16476, 24691, 4566

Offset: 0

Gus Wiseman, Mar 24 2023

nonn

These are partitions of n whose length is an odd divisor of n.

			The a(1) = 1 through a(10) = 8 partitions (A = 10):
  1   2   3     4   5       6     7         8   9           A
          111       11111   222   1111111       333         22222
                            321                 432         32221
                            411                 441         33211
                                                522         42211
                                                531         43111
                                                621         52111
                                                711         61111
                                                111111111
For example, the partition (3,3,2,1,1) has length 5 and mean 2, so is counted under a(10).

Andrew Howroyd, Table of n, a(n) for n = 0..1000

Odd-length partitions are counted by A027193, bisection A236559.
Including even-length gives A067538 bisected, strict A102627, ranks A316413.
The even-length version is counted by A361655.
A000041 counts integer partitions, strict A000009.
A027187 counts even-length partitions, bisection A236913.
A051293 counts subsets with integer mean, median A000975.
A058398 counts partitions by mean, see also A008284, A327482.
A325347 counts partitions with integer median, complement A307683.
A326567/A326568 gives mean of prime indices.
A326622 counts factorizations with integer mean.
Cf. A000016, A067659, A082550, A237984, A240219, A327475, A348551, A361653.

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

a(n)=if(n==0, 0, sumdiv(n, d, if(d%2, polcoef(1/prod(k=1, d, 1 - x^k + O(x^(n-d+1))), n-d)))) \\ Andrew Howroyd, Mar 24 2023

A360668 Numbers > 1 whose greatest prime index is not divisible by their number of prime factors (bigomega).

Original entry on oeis.org

4, 8, 10, 12, 15, 16, 18, 22, 24, 25, 27, 28, 32, 33, 34, 36, 40, 42, 44, 46, 48, 51, 54, 55, 60, 62, 63, 64, 66, 68, 69, 70, 72, 76, 77, 80, 81, 82, 85, 88, 90, 93, 94, 96, 98, 99, 100, 102, 104, 105, 108, 110, 112, 114, 115, 116, 118, 119, 120, 121, 123, 124

Offset: 1

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

Also numbers > 1 whose first differences of 0-prepended prime indices have non-integer mean.

			The prime indices of 1617 are {2,4,4,5}, and 5 is not divisible by 4, so 1617 is in the sequence.

These partitions are counted by A200727.
The complement is A340610 (without 1), counted by A168659.
For median instead of mean we have A360557, counted by A360691.
Positions of terms > 1 in A360615 (numerator: A360614).
A058398 counts partitions by mean, see also A008284, A327482.
A067340 lists numbers whose prime signature has integer mean.
A112798 = prime indices, length A001222, sum A056239, mean A326567/A326568.
A334201 adds up all prime indices except the greatest.
A348551 = numbers w/ non-integer mean of prime indices, complement A316413.
Cf. A072978, A078175, A139710, A307683, A359912, A360551, A360554, A360556, A360669.

Select[Range[2,100],!Divisible[PrimePi[FactorInteger[#][[-1,1]]],PrimeOmega[#]]&]

A360680 Numbers for which the prime signature has the same mean as the first differences of 0-prepended prime indices.

Original entry on oeis.org

1, 2, 6, 30, 49, 152, 210, 513, 1444, 1776, 1952, 2310, 2375, 2664, 2760, 2960, 3249, 3864, 3996, 4140, 4144, 5796, 5994, 6072, 6210, 6440, 6512, 6517, 6900, 7176, 7400, 7696, 8694, 9025, 9108, 9384, 10064, 10120, 10350, 10488, 10764, 11248, 11960, 12167

Offset: 1

Gus Wiseman, Feb 19 2023

nonn

A number's (unordered) prime signature (row n of A118914) is the multiset of positive exponents in its prime factorization.

			The terms together with their prime indices begin:
      1: {}
      2: {1}
      6: {1,2}
     30: {1,2,3}
     49: {4,4}
    152: {1,1,1,8}
    210: {1,2,3,4}
    513: {2,2,2,8}
   1444: {1,1,8,8}
   1776: {1,1,1,1,2,12}
   1952: {1,1,1,1,1,18}
   2310: {1,2,3,4,5}
   2375: {3,3,3,8}
   2664: {1,1,1,2,2,12}
   2760: {1,1,1,2,3,9}
   2960: {1,1,1,1,3,12}
For example, the prime indices of 2760 are {1,1,1,2,3,9}. The signature is (3,1,1,1), with mean 3/2. The first differences of 0-prepended prime indices are (1,0,0,1,1,6), with mean also 3/2. So 2760 is in the sequence.

For indices instead of 0-prepended differences: A359903, counted by A360068.
For median instead of mean we have A360681.
A112798 = prime indices, length A001222, sum A056239, mean A326567/A326568.
A124010 gives prime signature, mean A088529/A088530.
A316413 = numbers whose prime indices have integer mean, complement A348551.
A326619/A326620 gives mean of distinct prime indices.
A360614/A360615 = mean of first differences of 0-prepended prime indices.
Cf. A340610, A359904, A359905, A360008, A360460, A360555, A360556.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[1000],Mean[Length/@Split[prix[#]]] == Mean[Differences[Prepend[prix[#],0]]]&]

A360683 Number of integer partitions of n whose second differences sum to 0, meaning either there is only one part, or the first two parts have the same difference as the last two parts.

Original entry on oeis.org

1, 1, 2, 3, 4, 4, 8, 6, 11, 12, 17, 14, 32, 23, 40, 44, 64, 59, 104, 93, 149, 157, 218, 227, 342, 349, 481, 538, 713, 777, 1052, 1145, 1494, 1692, 2130, 2416, 3064, 3449, 4286, 4918, 6028, 6882, 8424, 9620, 11634, 13396, 16022, 18416, 22019, 25248, 29954

Offset: 0

Gus Wiseman, Feb 19 2023

nonn

			The a(1) = 1 through a(8) = 11 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (21)   (22)    (32)     (33)      (43)       (44)
             (111)  (31)    (41)     (42)      (52)       (53)
                    (1111)  (11111)  (51)      (61)       (62)
                                     (222)     (22111)    (71)
                                     (321)     (1111111)  (2222)
                                     (2211)               (3221)
                                     (111111)             (3311)
                                                          (22211)
                                                          (221111)
                                                          (11111111)

For mean instead of sum we have a(n) - A008619(n).
For median instead of sum we have A360682.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by number of parts.
A067538 counts partitions with integer mean, strict A102627.
A316413 ranks partitions with integer mean, complement A348551.
Cf. A114638, A240219, A325347, A360068.

Table[Length[Select[IntegerPartitions[n],Total[Differences[#,2]]==0&]],{n,0,30}]

A361392 Number of integer partitions of n whose first differences have mean -1.

Original entry on oeis.org

0, 0, 0, 1, 0, 2, 1, 3, 2, 5, 4, 8, 7, 12, 12, 19, 19, 29, 31, 43, 48, 65, 73, 97, 110, 142, 164, 208, 240, 301, 350, 432, 504, 617, 719, 874, 1019, 1228, 1434, 1717, 2001, 2385, 2778, 3292, 3831, 4522, 5252, 6177, 7164, 8392, 9722, 11352, 13125, 15283, 17643

Offset: 0

Gus Wiseman, Mar 13 2023

nonn

These are partitions where the first part minus the last part is the number of parts minus 1.

			The a(3) = 1 through a(11) = 8 partitions:
  (21)  .  (32)   (321)  (43)    (422)   (54)     (442)    (65)
           (311)         (331)   (4211)  (432)    (4321)   (533)
                         (4111)          (4221)   (4411)   (4331)
                                         (4311)   (52111)  (4421)
                                         (51111)           (5222)
                                                           (52211)
                                                           (53111)
                                                           (611111)
For example, the partition y = (4,2,2,1) has first differences (-2,0,-1), with mean -1, so y is counted under a(9).

For mean 0 we have A032741.
The 0-appended version is A047993.
For any negative mean we have A144300.
A000041 counts integer partitions, strict A000009.
A008284/A058398/A327482 count partitions by mean.
A067538 counts partitions with integer mean, ranks A316413.
A326567/A326568 gives mean of prime indices, conjugate A326839/A326840.
A360614/A360615 gives mean of 0-appended first differences of prime indices.
Cf. A102627, A237363, A237832, A348551, A360688.

Table[Length[Select[IntegerPartitions[n],Mean[Differences[#]]==-1&]],{n,0,30}]

cp's OEIS Frontend

A361655 Number of even-length integer partitions of 2n with integer mean.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A348384 Heinz numbers of integer partitions whose length is 2/3 their sum.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A361391 Number of strict integer partitions of n with non-integer mean.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

Extensions

A361656 Number of odd-length integer partitions of n with integer mean.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A360668 Numbers > 1 whose greatest prime index is not divisible by their number of prime factors (bigomega).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A360680 Numbers for which the prime signature has the same mean as the first differences of 0-prepended prime indices.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A360683 Number of integer partitions of n whose second differences sum to 0, meaning either there is only one part, or the first two parts have the same difference as the last two parts.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A361392 Number of integer partitions of n whose first differences have mean -1.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs