A237832 -id:A237832 - cp's OEIS frontend

A362047 Numbers whose prime indices satisfy: (maximum) - (minimum) = (mean).

10, 30, 39, 90, 98, 99, 100, 115, 259, 270, 273, 300, 490, 495, 517, 663, 665, 793, 810, 900, 1000, 1083, 1241, 1421, 1495, 1521, 1691, 1911, 2058, 2079, 2125, 2145, 2369, 2430, 2450, 2475, 2662, 2700, 2755, 2821, 3000, 3277, 4247, 4495, 4921, 5587, 5863, 6069

Offset: 1

Gus Wiseman, Apr 11 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:
      10: {1,3}
      30: {1,2,3}
      39: {2,6}
      90: {1,2,2,3}
      98: {1,4,4}
      99: {2,2,5}
     100: {1,1,3,3}
     115: {3,9}
     259: {4,12}
     270: {1,2,2,2,3}
     273: {2,4,6}
     300: {1,1,2,3,3}
The prime indices of 490 are {1,3,4,4}, with minimum 1, maximum 4, and mean 3, and 4-1 = 3, so 490 is in the sequence.

Partitions of this type are counted by A361862.
For minimum instead of mean we have A361908, counted by A118096.
A055396 gives minimum prime index, A061395 maximum.
A112798 list prime indices, length A001222, sum A056239.
A243055 subtracts the least prime index from the greatest.
A326844 gives the diagram complement size of Heinz partition.
Cf. A111907, A237832, A268192, A316413, A326836, A326837, A326846, A359358, A359360, A361855.

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

from itertools import count, islice
from sympy import primepi, factorint
def A362047_gen(startvalue=2): # generator of terms >= startvalue
    return filter(lambda n:(primepi(max(f:=factorint(n)))-primepi(min(f)))*sum(f.values())==sum(primepi(i)*j for i, j in f.items()),count(max(startvalue,2)))
A362047_list = list(islice(A362047_gen(),20)) # Chai Wah Wu, Apr 13 2023

A359360(a(n)) = A326844(a(n)).
A243055(a(n)) = A061395(a(n)) - A055396(a(n))
              = A326567(a(n))/A326568(a(n))
              = A056239(a(n))/A001222(a(n)).

A361862 Number of integer partitions of n such that (maximum) - (minimum) = (mean).

Original entry on oeis.org

0, 0, 0, 1, 0, 1, 0, 3, 2, 2, 0, 7, 0, 3, 6, 10, 0, 13, 0, 17, 10, 5, 0, 40, 12, 6, 18, 34, 0, 62, 0, 50, 24, 8, 60, 125, 0, 9, 32, 169, 0, 165, 0, 95, 176, 11, 0, 373, 114, 198, 54, 143, 0, 384, 254, 574, 66, 14, 0, 1090, 0, 15, 748, 633, 448, 782, 0, 286

Offset: 1

Gus Wiseman, Apr 10 2023

nonn

In terms of partition diagrams, these are partitions whose rectangle from the left (length times minimum) has the same size as the complement.

			The a(4) = 1 through a(12) = 7 partitions:
  (31)  .  (321)  .  (62)    (441)  (32221)  .  (93)
                     (3221)  (522)  (33211)     (642)
                     (3311)                     (4431)
                                                (5322)
                                                (322221)
                                                (332211)
                                                (333111)
The partition y = (4,4,3,1) has maximum 4 and minimum 1 and mean 3, and 4 - 1 = 3, so y is counted under a(12). The diagram of y is:
  o o o o
  o o o o
  o o o .
  o . . .
Both the rectangle from the left and the complement have size 4.

Positions of zeros are 1 and A000040.
For length instead of mean we have A237832.
For minimum instead of mean we have A118096.
These partitions have ranks A362047.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by length, A058398 by mean.
A067538 counts partitions with integer mean.
A097364 counts partitions by (maximum) - (minimum).
A243055 subtracts the least prime index from the greatest.
A326844 gives the diagram complement size of Heinz partition.
Cf. A237984, A240219, A326836, A326837, A327482, A237755, A237824, A349156, A359360, A360068, A360241, A361853.

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

A363222 Numbers whose multiset of prime indices satisfies (maximum) - (minimum) = (length).

Original entry on oeis.org

10, 21, 28, 42, 55, 70, 88, 91, 98, 99, 132, 165, 187, 198, 208, 220, 231, 247, 308, 312, 325, 330, 351, 363, 391, 455, 462, 468, 484, 520, 544, 550, 551, 585, 702, 713, 715, 726, 728, 770, 780, 816, 819, 833, 845, 975, 1073, 1078, 1092, 1144, 1170, 1210, 1216

Offset: 1

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

			The terms together with their prime indices begin:
    10: {1,3}
    21: {2,4}
    28: {1,1,4}
    42: {1,2,4}
    55: {3,5}
    70: {1,3,4}
    88: {1,1,1,5}
    91: {4,6}
    98: {1,4,4}
    99: {2,2,5}
   132: {1,1,2,5}
   165: {2,3,5}
   187: {5,7}
   198: {1,2,2,5}

The RHS is A001222.
Partitions of this type are counted by A237832.
The LHS (maximum minus minimum) is A243055.
A001221 (omega) counts distinct prime factors.
A112798 lists prime indices, sum A056239.
A360005 gives median of prime indices, distinct A360457.
Cf. A067801, A111907, A118096, A237821, A361205, A361908, A361909.

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

A061395(a(n)) - A055396(a(n)) = A001222(a(n)).

A318205 a(n) is the number of integer partitions of n for which the rank is equal to the index of the seaweed algebra formed by the integer partition paired with its weight.

Original entry on oeis.org

1, 1, 2, 1, 1, 2, 2, 5, 2, 7, 7, 6, 10, 12, 12, 16, 14, 22, 27, 28, 44, 52, 61, 76, 93, 112, 135, 162, 209, 243, 300, 350, 425, 484, 600, 662, 863, 964, 1153, 1351, 1629, 1874, 2244, 2584, 3074, 3507, 4213, 4805, 5725, 6524, 7742, 8770, 10357, 11813, 13936, 15704, 18445, 20896, 24552, 27724

Offset: 1

Nick Mayers, Aug 21 2018

nonn

The index of a Lie algebra, g, is an invariant of the Lie algebra defined by min(dim(Ker(B_f)) where the min is taken over all linear functionals f on g and B_f denotes the bilinear form f([,]) were [,] denotes the bracket multiplication on g.
For seaweed subalgebras of sl(n), which are Lie subalgebras of sl(n) whose matrix representations are parametrized by an ordered pair of compositions of n, the index can be determined from a corresponding graph called a meander.
a(n)>0 for n>0. To see this for n, take the partition (n).

V. Coll, M. Hyatt, C. Magnant, H. Wang, Meander graphs and Frobenius seaweed Lie algebras II, Journal of Generalized Lie Theory and Applications 9 (1) (2015) 227.
V. Dergachev, A. Kirillov, Index of Lie algebras of seaweed type, J. Lie Theory 10 (2) (2000) 331-343.

Cf. A237832, A318176, A318177, A318178, A318196

A318238 a(n) is the number of integer partitions of n for which the crank is equal to the index of the seaweed algebra formed by the integer partition paired with its weight.

Original entry on oeis.org

0, 0, 1, 1, 1, 1, 2, 2, 2, 3, 6, 5, 5, 8, 14, 15, 15, 24, 27, 38, 47, 58, 66, 83, 92, 118, 156, 187, 234, 262, 329, 367, 446, 517, 657, 712, 890, 1041, 1270, 1411, 1751, 1951, 2350, 2678, 3278, 3715

Offset: 1

Nick Mayers, Melissa Mayers, Aug 21 2018

The index of a Lie algebra, g, is an invariant of the Lie algebra defined by min(dim(Ker(B_f)) where the min is taken over all linear functionals f on g and B_f denotes the bilinear form f([,]) were [,] denotes the bracket multiplication on g.
For seaweed subalgebras of sl(n), which are Lie subalgebras of sl(n) whose matrix representations are parametrized by an ordered pair of compositions of n, the index can be determined from a corresponding graph called a meander.
a(n)>0 for n>2. To see this: if n=k+1 take the partition (k,1).

V. Coll, M. Hyatt, C. Magnant, H. Wang, Meander graphs and Frobenius seaweed Lie algebras II, Journal of Generalized Lie Theory and Applications 9 (1) (2015) 227.
V. Dergachev, A. Kirillov, Index of Lie algebras of seaweed type, J. Lie Theory 10 (2) (2000) 331-343.

Cf. A237832, A318176, A318177, A318178, A318196, A318203

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

A362047 Numbers whose prime indices satisfy: (maximum) - (minimum) = (mean).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Python

Formula

A361862 Number of integer partitions of n such that (maximum) - (minimum) = (mean).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A363222 Numbers whose multiset of prime indices satisfies (maximum) - (minimum) = (length).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A318205 a(n) is the number of integer partitions of n for which the rank is equal to the index of the seaweed algebra formed by the integer partition paired with its weight.

Views

Author

Keywords

Comments

Links

Crossrefs

A318238 a(n) is the number of integer partitions of n for which the crank is equal to the index of the seaweed algebra formed by the integer partition paired with its weight.

Views

Author

Keywords

Comments

Links

Crossrefs

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica