A325231 -id:A325231 - cp's OEIS frontend

A325230 Numbers of the form p^k * q, p and q prime, p > q, k > 0.

6, 10, 14, 15, 18, 21, 22, 26, 33, 34, 35, 38, 39, 46, 50, 51, 54, 55, 57, 58, 62, 65, 69, 74, 75, 77, 82, 85, 86, 87, 91, 93, 94, 95, 98, 106, 111, 115, 118, 119, 122, 123, 129, 133, 134, 141, 142, 143, 145, 146, 147, 155, 158, 159, 161, 162, 166, 177, 178

Offset: 1

Gus Wiseman, Apr 13 2019

nonn

			The sequence of terms together with their prime indices begins:
    6: {1,2}
   10: {1,3}
   14: {1,4}
   15: {2,3}
   18: {1,2,2}
   21: {2,4}
   22: {1,5}
   26: {1,6}
   33: {2,5}
   34: {1,7}
   35: {3,4}
   38: {1,8}
   39: {2,6}
   46: {1,9}
   50: {1,3,3}
   51: {2,7}
   54: {1,2,2,2}
   55: {3,5}
   57: {2,8}
   58: {1,10}

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

Positions of 1's in A325226.

Cf. A056239, A093641, A112798, A174090, A257541, A307517, A325223, A325224, A325225, A325231.

filter:= proc(n) local F;
   F:= sort(ifactors(n)[2],(a,b)-> a[1]Robert Israel, Apr 14 2019

Select[Range[100],PrimeOmega[#/Power@@FactorInteger[#][[-1]]]==1&]

from sympy import factorint
A325230_list = [n for n, m in ((n, factorint(n)) for n in range(2,10**6)) if len(m) == 2 and m[min(m)] == 1] # Chai Wah Wu, Apr 16 2019

A325223 Sum of the prime indices of n minus the greater of the number of prime factors of n counted with multiplicity and the largest prime index of n.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 0, 0, 2, 1, 0, 1, 0, 1, 2, 0, 0, 2, 0, 2, 2, 1, 0, 1, 3, 1, 3, 2, 0, 3, 0, 0, 2, 1, 3, 2, 0, 1, 2, 2, 0, 3, 0, 2, 4, 1, 0, 1, 4, 4, 2, 2, 0, 3, 3, 3, 2, 1, 0, 3, 0, 1, 4, 0, 3, 3, 0, 2, 2, 4, 0, 2, 0, 1, 5, 2, 4, 3, 0, 2, 4, 1, 0, 4, 3, 1, 2

Offset: 1

Gus Wiseman, Apr 12 2019

nonn

A prime index of n is a number m such that prime(m) divides n.

Also the number of squares in the Young diagram of the integer partition with Heinz number n after the first row or the first column, whichever is larger, is removed. The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

			88 has 4 prime indices {1,1,1,5} with sum 8 and maximum 5, so a(88) = 8 - max(4,5) = 3.

FindStat, St000784: The maximum of the length and the largest part of the integer partition

Positions of 0's are A174090. Positions of 1's are A325231.

Cf. A001222, A051924, A052126, A056239, A061395, A064989, A065770, A112798, A257990, A263297, A325134, A325169, A325224, A325225, A325227.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Total[primeMS[n]]-Max[Length[primeMS[n]],Max[primeMS[n]]],{n,100}]

a(n) = A056239(n) - max(A001222(n), A061395(n)) = A056239(n) - A263297(n).

A325228 Number of integer partitions of n such that the lesser of the maximum part and the number of parts is 3.

Original entry on oeis.org

0, 0, 0, 0, 1, 3, 6, 9, 13, 16, 20, 24, 28, 32, 38, 42, 48, 54, 60, 66, 74, 80, 88, 96, 104, 112, 122, 130, 140, 150, 160, 170, 182, 192, 204, 216, 228, 240, 254, 266, 280, 294, 308, 322, 338, 352, 368, 384, 400, 416, 434, 450, 468, 486, 504, 522, 542, 560

Offset: 1

Gus Wiseman, Apr 12 2019

nonn

			The a(5) = 1 through a(10) = 16 partitions:
  (311)  (321)   (322)    (332)     (333)      (433)
         (411)   (331)    (422)     (432)      (442)
         (3111)  (421)    (431)     (441)      (532)
                 (511)    (521)     (522)      (541)
                 (3211)   (611)     (531)      (622)
                 (31111)  (3221)    (621)      (631)
                          (3311)    (711)      (721)
                          (32111)   (3222)     (811)
                          (311111)  (3321)     (3322)
                                    (32211)    (3331)
                                    (33111)    (32221)
                                    (321111)   (33211)
                                    (3111111)  (322111)
                                               (331111)
                                               (3211111)
                                               (31111111)

Column k = 3 of A325227.

Cf. A051924, A096771, A115720, A265283, A325224, A325225, A325229, A325231, A325232.

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

cp's OEIS Frontend

A325230 Numbers of the form p^k * q, p and q prime, p > q, k > 0.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Python

A325223 Sum of the prime indices of n minus the greater of the number of prime factors of n counted with multiplicity and the largest prime index of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A325228 Number of integer partitions of n such that the lesser of the maximum part and the number of parts is 3.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica