A361849 -id:A361849 - cp's OEIS frontend

A053263 Coefficients of the '5th-order' mock theta function chi_1(q).

1, 2, 2, 3, 3, 4, 4, 6, 5, 7, 8, 9, 9, 12, 12, 15, 15, 18, 19, 23, 23, 27, 30, 33, 34, 41, 42, 49, 51, 57, 61, 69, 72, 81, 87, 96, 100, 113, 119, 132, 140, 153, 163, 180, 188, 208, 221, 240, 253, 278, 294, 319, 339, 366, 388, 422, 443, 481, 510, 549, 580, 626, 662

Offset: 0

Dean Hickerson, Dec 19 1999

The rank of a partition is its largest part minus the number of parts.
Number of partitions of n such that 2*(least part) > greatest part. - Clark Kimberling, Feb 16 2014
Also the number of partitions of n with the same median as maximum. These are conjugate to the partitions described above. For minimum instead of maximum we have A361860. - Gus Wiseman, Apr 23 2023

			From _Gus Wiseman_, Apr 20 2023: (Start)
The a(1) = 1 through a(8) = 6 partitions such that 2*(minimum) > (maximum):
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (111)  (22)    (32)     (33)      (43)       (44)
                    (1111)  (11111)  (222)     (322)      (53)
                                     (111111)  (1111111)  (332)
                                                          (2222)
                                                          (11111111)
The a(1) = 1 through a(8) = 6 partitions such that (median) = (maximum):
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (111)  (22)    (221)    (33)      (331)      (44)
                    (1111)  (11111)  (222)     (2221)     (332)
                                     (111111)  (1111111)  (2222)
                                                          (22211)
                                                          (11111111)
(End)

Srinivasa Ramanujan, Collected Papers, Chelsea, New York, 1962, pp. 354-355
Srinivasa Ramanujan, The Lost Notebook and Other Unpublished Papers, Narosa Publishing House, New Delhi, 1988, pp. 20, 25

Vaclav Kotesovec, Table of n, a(n) for n = 0..5000 (terms 0..1000 from Seiichi Manyama)
George E. Andrews, The fifth and seventh order mock theta functions, Trans. Amer. Math. Soc., 293 (1986) 113-134.
George E. Andrews and Frank G. Garvan, Ramanujan's "lost" notebook VI: The mock theta conjectures, Advances in Mathematics, 73 (1989) 242-255.
George N. Watson, The mock theta functions (2), Proc. London Math. Soc., series 2, 42 (1937) 274-304.

Other '5th-order' mock theta functions are at A053256, A053257, A053258, A053259, A053260, A053261, A053262, A053264, A053265, A053266, A053267.
Cf. A047993, A240874, A361800, A361849 (ranks A361856), A361860.
A000041 counts integer partitions, strict A000009, odd-length A027193.
A359893 and A359901 count partitions by median.
Cf. A013580, A079309, A237753, A237757, A237800, A361848, A361858, A361859.

1+Series[Sum[q^(2n+1)(1+q^n)/Product[1-q^k, {k, n+1, 2n+1}], {n, 0, 49}], {q, 0, 100}]
(* Also: *)
Table[Count[ IntegerPartitions[n], p_ /; 2 Min[p] > Max[p]], {n, 40}]
(* Clark Kimberling, Feb 16 2014 *)
nmax = 100; CoefficientList[Series[1 + Sum[x^(2*k+1)*(1+x^k) / Product[1-x^j, {j, k+1, 2*k+1}], {k, 0, Floor[nmax/2]}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Jun 12 2019 *)

G.f.: chi_1(q) = Sum_{n>=0} q^n/((1-q^(n+1))(1-q^(n+2))...(1-q^(2n+1))).
G.f.: chi_1(q) = 1 + Sum_{n>=0} q^(2n+1) (1+q^n)/((1-q^(n+1))(1-q^(n+2))...(1-q^(2n+1))).
a(n) is twice the number of partitions of 5n+3 with rank == 2 (mod 5) minus number with rank == 0 or 1 (mod 5).
a(n) - 1 is the number of partitions of n with unique smallest part and all other parts <= one plus twice the smallest part.
a(n) ~ sqrt(phi/2) * exp(Pi*sqrt(2*n/15)) / (5^(1/4)*sqrt(n)), where phi = A001622 = (1+sqrt(5))/2 is the golden ratio. - Vaclav Kotesovec, Jun 16 2019

A361856 Positive integers whose prime indices satisfy (maximum) = 2*(median).

Original entry on oeis.org

12, 24, 42, 48, 60, 63, 72, 96, 126, 130, 140, 144, 189, 192, 195, 252, 266, 288, 308, 325, 330, 360, 378, 384, 399, 420, 432, 495, 546, 567, 572, 576, 588, 600, 630, 638, 650, 665, 756, 768, 819, 864, 882, 884, 931, 945, 957, 962, 975, 1122, 1134, 1152, 1190

Offset: 1

Gus Wiseman, Apr 02 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).
These are Heinz numbers of partitions satisfying (maximum) = 2*(median).

			The terms together with their prime indices begin:
    12: {1,1,2}
    24: {1,1,1,2}
    42: {1,2,4}
    48: {1,1,1,1,2}
    60: {1,1,2,3}
    63: {2,2,4}
    72: {1,1,1,2,2}
    96: {1,1,1,1,1,2}
   126: {1,2,2,4}
   130: {1,3,6}
   140: {1,1,3,4}
   144: {1,1,1,1,2,2}
The prime indices of 126 are {1,2,2,4}, with maximum 4 and median 2, so 126 is in the sequence.
The prime indices of 308 are {1,1,4,5}, with maximum 5 and median 5/2, so 308 is in the sequence.

The LHS (greatest prime index) is A061395.
The RHS (twice median) is A360005, distinct A360457.
These partitions are counted by A361849.
For mean instead of median we have A361855, counted by A361853.
For minimum instead of median we have A361908, counted by A118096.
For length instead of median we have A361909, counted by A237753.
A000975 counts subsets with integer median.
A001222 (bigomega) counts prime factors, distinct A001221 (omega).
A112798 lists prime indices, sum A056239.
A325347 counts partitions with integer median, complement A307683.
A359893 and A359901 count partitions by median.
Cf. A027193, A067801, A111907, A361205, A361848, A361858.

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

A061395(a(n)) = 2*A360005(a(n)).

A361848 Number of integer partitions of n such that (maximum) <= 2*(median).

Original entry on oeis.org

1, 2, 3, 5, 6, 9, 12, 15, 19, 26, 31, 40, 49, 61, 75, 93, 112, 137, 165, 199, 238, 289, 341, 408, 482, 571, 674, 796, 932, 1096, 1280, 1495, 1738, 2026, 2347, 2724, 3148, 3639, 4191, 4831, 5545, 6372, 7298, 8358, 9552, 10915, 12439, 14176, 16121, 18325

Offset: 0

Gus Wiseman, Mar 28 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(1) = 1 through a(7) = 12 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)
       (11)  (21)   (22)    (32)     (33)      (43)
             (111)  (31)    (41)     (42)      (52)
                    (211)   (221)    (51)      (61)
                    (1111)  (2111)   (222)     (322)
                            (11111)  (321)     (331)
                                     (2211)    (421)
                                     (21111)   (2221)
                                     (111111)  (3211)
                                               (22111)
                                               (211111)
                                               (1111111)
For example, the partition y = (3,2,2) has maximum 3 and median 2, and 3 <= 2*2, so y is counted under a(7).

For length instead of median we have A237755.
For minimum instead of median we have A237824.
The equal case is A361849, ranks A361856.
For mean instead of median we have A361851.
The complement is counted by A361857, ranks A361867.
The unequal case is A361858.
Reversing the inequality gives A361859, ranks A361868.
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, A013580, A027193, A061395, A067538, A111907, A240219, A324562, A359907, A361394, A361860.

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

a(n) = A361849(n) + A361858(n).

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

A361853 Number of integer partitions of n such that (length) * (maximum) = 2n.

Original entry on oeis.org

0, 0, 0, 0, 0, 2, 0, 1, 2, 4, 0, 10, 0, 8, 16, 10, 0, 31, 0, 44, 44, 20, 0, 92, 50, 28, 98, 154, 0, 266, 0, 154, 194, 48, 434, 712, 0, 60, 348, 910, 0, 1198, 0, 1120, 2138, 88, 0, 2428, 1300, 1680, 912, 2506, 0, 4808, 4800, 5968, 1372, 140, 0, 14820, 0, 160

Offset: 1

Gus Wiseman, Mar 29 2023

nonn

Also partitions satisfying (maximum) = 2*(mean).

These are partitions whose diagram has the same size as its complement (see example).

			The a(6) = 2 through a(12) = 10 partitions:
  (411)   .  (4211)  (621)     (5221)   .  (822)
  (3111)             (321111)  (5311)      (831)
                               (42211)     (6222)
                               (43111)     (6321)
                                           (6411)
                                           (422211)
                                           (432111)
                                           (441111)
                                           (32211111)
                                           (33111111)
The partition y = (6,4,1,1) has diagram:
  o o o o o o
  o o o o . .
  o . . . . .
  o . . . . .
Since the partition and its complement (shown in dots) have the same size, y is counted under a(12).

For minimum instead of mean we have A118096.
For length instead of mean we have A237753.
For median instead of mean we have A361849, ranks A361856.
This is the equal case of A361851, unequal case A361852.
The strict case is A361854.
These partitions have ranks A361855.
This is the equal case of A361906, unequal case A361907.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by length, A058398 by mean.
A051293 counts subsets with integer mean.
A067538 counts partitions with integer mean.
A268192 counts partitions by complement size, ranks A326844.
Cf. A111907, A116608, A188814, A237755, A237824, A237984, A240219, A326849, A327482, A349156, A359894.

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

A361851 Number of integer partitions of n such that (length) * (maximum) <= 2*n.

Original entry on oeis.org

1, 2, 3, 5, 7, 11, 12, 18, 23, 31, 37, 51, 58, 75, 96, 116, 126, 184, 193, 253, 307, 346, 402, 511, 615, 678, 792, 1045, 1088, 1386, 1419, 1826, 2181, 2293, 2779, 3568, 3659, 3984, 4867, 5885, 6407, 7732, 8124, 9400, 11683, 13025, 13269, 16216, 17774, 22016

Offset: 1

Gus Wiseman, Mar 28 2023

nonn

Also partitions such that (maximum) <= 2*(mean).

These are partitions whose complement (see example) has size <= n.

			The a(1) = 1 through a(7) = 12 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)
       (11)  (21)   (22)    (32)     (33)      (43)
             (111)  (31)    (41)     (42)      (52)
                    (211)   (221)    (51)      (61)
                    (1111)  (311)    (222)     (322)
                            (2111)   (321)     (331)
                            (11111)  (411)     (421)
                                     (2211)    (2221)
                                     (3111)    (3211)
                                     (21111)   (22111)
                                     (111111)  (211111)
                                               (1111111)
The partition y = (3,2,1,1) has length 4 and maximum 3, and 4*3 <= 2*7, so y is counted under a(7).
The partition y = (5,2,1,1) has length 4 and maximum 5, and 4*5 is not <= 2*9, so y is not counted under a(9).
The partition y = (3,2,1,1) has diagram:
  o o o
  o o .
  o . .
  o . .
with complement of size 5, and 5 <= 7, so y is counted under a(7).

For length instead of mean we have A237755.
For minimum instead of mean we have A237824.
For median instead of mean we have A361848.
The equal case for median is A361849, ranks A361856.
The unequal case is A361852, median A361858.
The equal case is A361853, ranks A361855.
Reversing the inequality gives A361906, unequal case A361907.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by length, A058398 by mean.
A051293 counts subsets with integer mean.
A067538 counts partitions with integer mean.
Cf. A111907, A237984, A240219, A324521, A324562, A327482, A349156, A360068, A360071, A360241, A361394, A361859.

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

A361855 Numbers > 1 whose prime indices satisfy (maximum) * (length) = 2*(sum).

Original entry on oeis.org

28, 40, 78, 84, 171, 190, 198, 220, 240, 252, 280, 351, 364, 390, 406, 435, 714, 748, 756, 765, 777, 784, 814, 840, 850, 925, 988, 1118, 1197, 1254, 1330, 1352, 1419, 1425, 1440, 1505, 1564, 1600, 1638, 1716, 1755, 1794, 1802, 1820, 1950, 2067, 2204, 2254

Offset: 1

Gus Wiseman, Mar 29 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 positive integers whose prime indices satisfy (maximum) = 2*(mean).
Also Heinz numbers of partitions of the same size as their complement (see example).

			The terms together with their prime indices begin:
   28: {1,1,4}
   40: {1,1,1,3}
   78: {1,2,6}
   84: {1,1,2,4}
  171: {2,2,8}
  190: {1,3,8}
  198: {1,2,2,5}
  220: {1,1,3,5}
  240: {1,1,1,1,2,3}
  252: {1,1,2,2,4}
  280: {1,1,1,3,4}
The prime indices of 84 are {1,1,2,4}, with maximum 4, length 4, and sum 8, and 4*4 = 2*8, so 84 is in the sequence.
The prime indices of 120 are {1,1,1,2,3}, with maximum 3, length 5, and sum 8, and 3*5 != 2*8, so 120 is not in the sequence.
The prime indices of 252 are {1,1,2,2,4}, with maximum 4, length 5, and sum 10, and 4*5 = 2*10, so 252 is in the sequence.
The partition (5,2,2,1) with Heinz number 198 has diagram:
  o o o o o
  o o . . .
  o o . . .
  o . . . .
Since the partition and its complement (shown in dots) both have size 10, 198 is in the sequence.

These partitions are counted by A361853, strict A361854.
For median instead of mean we have A361856, counted by A361849.
For minimum instead of mean we have A361908, counted by A118096.
For length instead of mean we have A361909, counted by A237753.
A001222 (bigomega) counts prime factors, distinct A001221 (omega).
A061395 gives greatest prime index.
A112798 lists prime indices, sum A056239.
A326567/A326568 gives mean of prime indices.
Cf. A067801, A237824, A316413, A324521, A326844, A361205, A361851, A361906.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[2,100],Max@@prix[#]*PrimeOmega[#]==2*Total[prix[#]]&]

A061395(a(n)) * A001222(a(n)) = 2*A056239(a(n)).

A361858 Number of integer partitions of n such that the maximum is less than twice the median.

Original entry on oeis.org

1, 2, 3, 4, 5, 8, 8, 12, 15, 19, 22, 31, 34, 45, 55, 67, 78, 100, 115, 144, 170, 203, 238, 291, 337, 403, 473, 560, 650, 772, 889, 1046, 1213, 1414, 1635, 1906, 2186, 2533, 2913, 3361, 3847, 4433, 5060, 5808, 6628, 7572, 8615, 9835, 11158, 12698, 14394

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(1) = 1 through a(8) = 12 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (21)   (22)    (32)     (33)      (43)       (44)
             (111)  (31)    (41)     (42)      (52)       (53)
                    (1111)  (221)    (51)      (61)       (62)
                            (11111)  (222)     (322)      (71)
                                     (321)     (331)      (332)
                                     (2211)    (2221)     (431)
                                     (111111)  (1111111)  (2222)
                                                          (3221)
                                                          (3311)
                                                          (22211)
                                                          (11111111)
The partition y = (3,2,2,1) has maximum 3 and median 2, and 3 < 2*2, so y is counted under a(8).

For minimum instead of median we have A053263.
For length instead of median we have A237754.
Allowing equality gives A361848, strict A361850.
The equal version is A361849, ranks A361856.
For mean instead of median we have A361852.
Reversing the inequality gives A361857, ranks A361867.
The complement is counted by A361859, ranks A361868.
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, A237751, A237755, A237820, A237824, A240219, A361394, A361851, A361860, A361907.

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

A361860 Number of integer partitions of n whose median part is the smallest.

Original entry on oeis.org

1, 2, 2, 4, 4, 7, 8, 12, 15, 21, 25, 36, 44, 58, 72, 95, 117, 150, 185, 235, 289, 362, 441, 550, 670, 824, 1000, 1223, 1476, 1795, 2159, 2609, 3126, 3758, 4485, 5369, 6388, 7609, 9021, 10709, 12654, 14966, 17632, 20782, 24414, 28684, 33601, 39364, 45996

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(1) = 1 through a(8) = 12 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (111)  (22)    (311)    (33)      (322)      (44)
                    (211)   (2111)   (222)     (511)      (422)
                    (1111)  (11111)  (411)     (4111)     (611)
                                     (3111)    (22111)    (2222)
                                     (21111)   (31111)    (5111)
                                     (111111)  (211111)   (32111)
                                               (1111111)  (41111)
                                                          (221111)
                                                          (311111)
                                                          (2111111)
                                                          (11111111)

For mean instead of median we have A000005.
For length instead of median we have A006141.
For maximum instead of median we have A053263.
For half-median we have A361861.
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.
Cf. A027193, A053263, A067659, A111907, A116608, A118096, A237753, A240219, A359907, A361848, A361849.

Table[Length[Select[IntegerPartitions[n],Min@@#==Median[#]&]],{n,30}]

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

A361908 Positive integers > 1 whose prime indices satisfy (maximum) = 2*(minimum).

Original entry on oeis.org

6, 12, 18, 21, 24, 36, 48, 54, 63, 65, 72, 96, 105, 108, 133, 144, 147, 162, 189, 192, 216, 288, 315, 319, 324, 325, 384, 432, 441, 455, 481, 486, 525, 567, 576, 648, 715, 731, 735, 768, 845, 864, 931, 945, 972, 1007, 1029, 1152, 1296, 1323, 1403, 1458, 1463

Offset: 1

Gus Wiseman, Apr 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:
     6: {1,2}
    12: {1,1,2}
    18: {1,2,2}
    21: {2,4}
    24: {1,1,1,2}
    36: {1,1,2,2}
    48: {1,1,1,1,2}
    54: {1,2,2,2}
    63: {2,2,4}
    65: {3,6}
    72: {1,1,1,2,2}
    96: {1,1,1,1,1,2}

Robert Israel, Table of n, a(n) for n = 1..10000

The RHS is 2*A055396 (twice minimum).
The LHS is A061395 (greatest prime index).
Partitions of this type are counted by A118096.
For mean instead of minimum we have A361855, counted by A361853.
For median instead of minimum we have A361856, counted by A361849.
For length instead of minimum we have A361909, counted by A237753.
A001221 (omega) counts distinct prime factors.
A001222 (bigomega) counts prime factors with multiplicity.
A112798 lists prime indices, sum A056239.
Cf. A053263, A067801, A237820, A237821, A361858.

filter:= proc(n) local F,b;
  if n::even then b:= padic:-ordp(n,3);
     if b = 0 then return false else return n = 2^padic:-ordp(n,2) * 3^b fi
  fi;
  F:= ifactors(n)[2][..,1];
  nops(F) >= 2 and numtheory:-pi(max(F)) = 2*numtheory:-pi(min(F))
end proc:
select(filter, [$1..2000]); # Robert Israel, Mar 11 2025

Select[Range[2,100],PrimePi[FactorInteger[#][[-1,1]]]==2*PrimePi[FactorInteger[#][[1,1]]]&]

cp's OEIS Frontend

A053263 Coefficients of the '5th-order' mock theta function chi_1(q).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Formula

A361856 Positive integers whose prime indices satisfy (maximum) = 2*(median).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A361848 Number of integer partitions of n such that (maximum) <= 2*(median).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A361853 Number of integer partitions of n such that (length) * (maximum) = 2n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A361851 Number of integer partitions of n such that (length) * (maximum) <= 2*n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A361855 Numbers > 1 whose prime indices satisfy (maximum) * (length) = 2*(sum).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A361858 Number of integer partitions of n such that the maximum is less than twice the median.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A361860 Number of integer partitions of n whose median part is the smallest.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

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