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.

Showing 1-3 of 3 results.

A363132 Number of integer partitions of 2n such that 2*(minimum) = (mean).

Original entry on oeis.org

0, 0, 1, 2, 5, 6, 15, 14, 32, 34, 65, 55, 150, 100, 225, 237, 425, 296, 824, 489, 1267, 1133, 1809, 1254, 4018, 2142, 4499, 4550, 7939, 4564, 14571, 6841, 18285, 16047, 23408, 17495, 52545, 21636, 49943, 51182, 92516, 44582, 144872, 63260, 175318, 169232, 205353
Offset: 0

Views

Author

Gus Wiseman, May 23 2023

Keywords

Comments

Equivalently, n = (length)*(minimum).

Examples

			The a(2) = 1 through a(7) = 14 partitions:
  (31)  (321)  (62)    (32221)  (93)      (3222221)
        (411)  (3221)  (33211)  (552)     (3322211)
               (3311)  (42211)  (642)     (3332111)
               (4211)  (43111)  (732)     (4222211)
               (5111)  (52111)  (822)     (4322111)
                       (61111)  (322221)  (4331111)
                                (332211)  (4421111)
                                (333111)  (5222111)
                                (422211)  (5321111)
                                (432111)  (5411111)
                                (441111)  (6221111)
                                (522111)  (6311111)
                                (531111)  (7211111)
                                (621111)  (8111111)
                                (711111)

Crossrefs

Removing the factor 2 gives A099777.
Taking maximum instead of mean and including odd indices gives A118096.
For length instead of mean and including odd indices we have A237757.
For (maximum) = 2*(mean) see A361851, A361852, A361853, A361854, A361855.
For median instead of mean we have A361861.
These partitions have ranks A363133.
For maximum instead of minimum we have A363218.
For median instead of minimum we have A363224.
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. A053263, A111907, A237753, A237755, A237824, A327482, A349156, A361906, A361907, A363134.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[2n],2*Min@@#==Mean[#]&]],{n,0,15}]
  • Python
    from sympy.utilities.iterables import partitions
def A363132(n): return sum(1 for s,p in partitions(n<<1,m=n,size=True) if n==s*min(p,default=0)) if n else 0 # Chai Wah Wu, Sep 21 2023

Extensions

a(31)-a(46) from Chai Wah Wu, Sep 21 2023

A363218 Positive integers whose prime indices satisfy: (length) = 2*(maximum).

Original entry on oeis.org

4, 24, 36, 54, 81, 160, 240, 360, 400, 540, 600, 810, 896, 900, 1000, 1215, 1344, 1350, 1500, 2016, 2025, 2240, 2250, 2500, 3024, 3136, 3360, 3375, 3750, 4536, 4704, 5040, 5600, 5625, 5632, 6250, 6804, 7056, 7560, 7840, 8400, 8448, 9375, 10206, 10584, 10976
Offset: 1

Views

Author

Gus Wiseman, May 23 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.

Examples

			The terms together with their prime indices begin:
      4: {1,1}
     24: {1,1,1,2}
     36: {1,1,2,2}
     54: {1,2,2,2}
     81: {2,2,2,2}
    160: {1,1,1,1,1,3}
    240: {1,1,1,1,2,3}
    360: {1,1,1,2,2,3}
    400: {1,1,1,1,3,3}
    540: {1,1,2,2,2,3}
    600: {1,1,1,2,3,3}
    810: {1,2,2,2,2,3}
    896: {1,1,1,1,1,1,1,4}
    900: {1,1,2,2,3,3}
   1000: {1,1,1,3,3,3}
   1215: {2,2,2,2,2,3}
   1344: {1,1,1,1,1,1,2,4}
   1350: {1,2,2,2,3,3}
   1500: {1,1,2,3,3,3}
   2016: {1,1,1,1,1,2,2,4}
   2025: {2,2,2,2,3,3}
   2240: {1,1,1,1,1,1,3,4}

Crossrefs

The LHS (number of prime indices) is A001222.
The RHS is twice A061395.
Before multiplying by 2 we had A106529.
Partitions of this type are counted by A237753.
For sum instead of length we have A344415, counted by A035363.
An adjoint version is A361909, also counted by A237753.
For minimum instead of maximum we have A363134, counted by A237757.
A112798 lists prime indices, sum A056239.
A326567/A326568 gives mean of prime indices.
Cf. A001221, A067801, A118096, A324521, A237752, A361855, A361908, A363222.

Programs

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

Formula

Disjoint from A361909.

A363133 Numbers > 1 whose prime indices satisfy 2*(minimum) = (mean).

Original entry on oeis.org

10, 28, 30, 39, 84, 88, 90, 100, 115, 171, 208, 252, 255, 259, 264, 270, 273, 280, 300, 363, 517, 544, 624, 756, 783, 784, 792, 793, 810, 840, 880, 900, 925, 1000, 1035, 1085, 1197, 1216, 1241, 1425, 1495, 1521, 1595, 1615, 1632, 1683, 1691, 1785, 1872, 1911
Offset: 1

Views

Author

Gus Wiseman, May 29 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.

Examples

			The terms together with their prime indices begin:
    10: {1,3}
    28: {1,1,4}
    30: {1,2,3}
    39: {2,6}
    84: {1,1,2,4}
    88: {1,1,1,5}
    90: {1,2,2,3}
   100: {1,1,3,3}
   115: {3,9}
   171: {2,2,8}
   208: {1,1,1,1,6}
   252: {1,1,2,2,4}
   255: {2,3,7}
   259: {4,12}
   264: {1,1,1,2,5}

Crossrefs

Removing the factor 2 gives A000961.
For maximum instead of mean we have A361908, counted by A118096.
Partitions of this type are counted by A363132.
For length instead of mean we have A363134, counted by A237757.
For 2*(maximum) = (length) we have A363218, counted by A237753.
A051293 counts subsets with integer mean.
A112798 lists prime indices, length A001222, sum A056239.
A360005 gives twice median of prime indices.
Cf. A006141, A106529, A111907, A237755, A237824, A324522, A327482, A361860, A361861, A362050.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],Mean[prix[#]]==2*Min[prix[#]]&]
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.