A338907 -id:A338907 - cp's OEIS frontend

A339362 Sum of prime indices of the n-th squarefree semiprime.

3, 4, 5, 5, 6, 6, 7, 7, 8, 7, 9, 8, 10, 9, 8, 10, 11, 12, 9, 11, 13, 9, 14, 10, 15, 12, 10, 13, 16, 11, 17, 14, 12, 18, 11, 19, 15, 16, 12, 20, 17, 21, 11, 13, 22, 14, 23, 18, 13, 24, 19, 25, 20, 15, 12, 26, 21, 27, 14, 16, 28, 13, 22, 29, 17, 15, 30, 23, 13

Offset: 1

Gus Wiseman, Dec 06 2020

nonn

A squarefree semiprime (A006881) is a product of any two distinct prime numbers. A prime index of n is a number m such that the m-th prime number divides n. The multiset of prime indices of n is row n of A112798.

			The sequence of all squarefree semiprimes together with the sums of their prime indices begins:
   6: 1 + 2 = 3
  10: 1 + 3 = 4
  14: 1 + 4 = 5
  15: 2 + 3 = 5
  21: 2 + 4 = 6
  22: 1 + 5 = 6
  26: 1 + 6 = 7
  33: 2 + 5 = 7
  34: 1 + 7 = 8
  35: 3 + 4 = 7

A001358 lists semiprimes.
A003963 gives the product of prime indices of n.
A005117 lists squarefree numbers.
A006881 lists squarefree semiprimes.
A025129 gives the sum of squarefree semiprimes of weight n.
A056239 (weight) gives the sum of prime indices of n.
A332765/A339114 give the greatest/least squarefree semiprime of weight n.
A338898/A338912/A338913 give the prime indices of semiprimes, with product/sum/difference A087794/A176504/A176506.
A338899/A270650/A270652 give the prime indices of squarefree semiprimes, with product/sum/difference A339361/A339362/A338900.
A338904 groups semiprimes by weight.
A338905 groups squarefree semiprimes by weight.
A338907/A338908 list squarefree semiprimes of odd/even weight.
A339116 groups squarefree semiprimes by greater prime factor.
Cf. A001221, A046388, A065516, A112798, A115392, A166237, A320656, A338901, A339003, A339004.

Table[Plus@@PrimePi/@First/@FactorInteger[n],{n,Select[Range[100],SquareFreeQ[#]&&PrimeOmega[#]==2&]}]

a(n) = A056239(A006881(n)).

a(n) = A270650(n) + A270652(n).

A306145 Expansion of (1/(1 - x)) * Sum_{k>=0} x^(2k+1) / Product_{j=1..2k+1} (1 - x^j).

Original entry on oeis.org

0, 1, 2, 4, 6, 10, 15, 23, 33, 49, 69, 98, 135, 187, 253, 343, 456, 607, 797, 1045, 1355, 1755, 2252, 2884, 3666, 4651, 5863, 7375, 9226, 11517, 14310, 17741, 21904, 26988, 33130, 40586, 49558, 60394, 73383, 88996, 107642, 129958, 156519, 188178, 225734, 270335, 323078, 385494

Offset: 0

Ilya Gutkovskiy, Aug 19 2018

nonn

Partial sums of A027193.
From Gus Wiseman, Jun 23 2021: (Start)
Also the number of even-length integer partitions of 2n+1 with exactly one odd part. For example, the a(1) = 1 through a(5) = 10 partitions are:
  (2,1)  (3,2)  (4,3)      (5,4)      (6,5)
         (4,1)  (5,2)      (6,3)      (7,4)
                (6,1)      (7,2)      (8,3)
                (2,2,2,1)  (8,1)      (9,2)
                           (3,2,2,2)  (10,1)
                           (4,2,2,1)  (4,3,2,2)
                                      (4,4,2,1)
                                      (5,2,2,2)
                                      (6,2,2,1)
                                      (2,2,2,2,2,1)
Also partitions of 2n+1 with even greatest part and alternating sum 1.
(End)

Joerg Arndt, Matters Computational (The Fxtbook), section 16.4.1 "Unrestricted partitions and partitions into m parts", page 347.
Index entries for sequences related to partitions

First differences are A027193.
The ordered version appears to be A087447 modulo initial terms.
The version for odd instead of even-length partitions is A304620.
The case of strict partitions is A318156.
A000041 counts partitions of 2n with alternating sum 0, ranked by A000290.
A027187 counts partitions of even length, with strict case A067661.
A103919 counts partitions by sum and alternating sum (reverse: A344612).
A344610 counts partitions by sum and positive reverse-alternating sum.
Cf. A000070, A000097, A006330, A030229, A067659, A236559, A236914, A239829, A239830, A338907, A344611.

nmax = 47; CoefficientList[Series[1/(1 - x) Sum[x^(2 k + 1)/Product[(1 - x^j), {j, 1, 2 k + 1}], {k, 0, nmax}], {x, 0, nmax}], x]
nmax = 47; CoefficientList[Series[(1 - EllipticTheta[4, 0, x])/(2 (1 - x) QPochhammer[x]), {x, 0, nmax}], x]
Table[Length[Select[IntegerPartitions[n],EvenQ[Length[#]]&&Count[#,?OddQ]==1&]],{n,1,30,2}] (* _Gus Wiseman, Jun 23 2021 *)

a(n) = A000070(n) - A304620(n).

a(n) ~ exp(Pi*sqrt(2*n/3)) / (2^(5/2)*Pi*sqrt(n)). - Vaclav Kotesovec, Aug 20 2018

A339361 Product of prime indices of the n-th squarefree semiprime.

Original entry on oeis.org

2, 3, 4, 6, 8, 5, 6, 10, 7, 12, 8, 12, 9, 14, 15, 16, 10, 11, 18, 18, 12, 20, 13, 21, 14, 20, 24, 22, 15, 24, 16, 24, 27, 17, 28, 18, 26, 28, 32, 19, 30, 20, 30, 30, 21, 33, 22, 32, 36, 23, 34, 24, 36, 36, 35, 25, 38, 26, 40, 39, 27, 40, 40, 28, 42, 44, 29, 42

Offset: 1

Gus Wiseman, Dec 06 2020

nonn

A squarefree semiprime (A006881) is a product of any two distinct prime numbers. A prime index of n is a number m such that the m-th prime number divides n. The multiset of prime indices of n is row n of A112798.

			The sequence of all squarefree semiprimes together with the products of their prime indices begins:
   6: 1 * 2 = 2
  10: 1 * 3 = 3
  14: 1 * 4 = 4
  15: 2 * 3 = 6
  21: 2 * 4 = 8
  22: 1 * 5 = 5
  26: 1 * 6 = 6
  33: 2 * 5 = 10
  34: 1 * 7 = 7
  35: 3 * 4 = 12

A001358 lists semiprimes.
A003963 gives the product of prime indices of n.
A005117 lists squarefree numbers.
A006881 lists squarefree semiprimes.
A025129 is the sum of squarefree semiprimes of weight n.
A332765/A339114 give the greatest/least squarefree semiprime of weight n.
A338898/A338912/A338913 give the prime indices of semiprimes, with product/sum/difference A087794/A176504/A176506.
A338899/A270650/A270652 give the prime indices of squarefree semiprimes, with product/sum/difference A339361/A339362/A338900.
A338905 groups squarefree semiprimes by weight.
A338907/A338908 list squarefree semiprimes of odd/even weight.
A339116 groups squarefree semiprimes by greater prime factor.
Cf. A001221, A046388, A056239 (weight), A112798, A166237, A320656, A320911, A338901, A339002, A339003, A339004.

Table[Times@@PrimePi/@First/@FactorInteger[n],{n,Select[Range[100],SquareFreeQ[#]&&PrimeOmega[#]==2&]}]

a(n) = A003963(A006881(n)).

a(n) = A270650(n) * A270652(n).

A343942 Number of even-length strict integer partitions of 2n+1.

Original entry on oeis.org

0, 1, 2, 3, 4, 6, 9, 13, 19, 27, 38, 52, 71, 96, 128, 170, 224, 292, 380, 491, 630, 805, 1024, 1295, 1632, 2049, 2560, 3189, 3959, 4896, 6038, 7424, 9100, 11125, 13565, 16496, 20013, 24223, 29249, 35244, 42378, 50849, 60896, 72789, 86841, 103424, 122960, 145937, 172928

Offset: 0

Gus Wiseman, Jun 09 2021

nonn

By conjugation, also the number of integer partitions of 2n+1 covering an initial interval of positive integers with greatest part even.

			The a(1) = 1 through a(7) = 13 strict partitions:
  (2,1)  (3,2)  (4,3)  (5,4)  (6,5)      (7,6)      (8,7)
         (4,1)  (5,2)  (6,3)  (7,4)      (8,5)      (9,6)
                (6,1)  (7,2)  (8,3)      (9,4)      (10,5)
                       (8,1)  (9,2)      (10,3)     (11,4)
                              (10,1)     (11,2)     (12,3)
                              (5,3,2,1)  (12,1)     (13,2)
                                         (5,4,3,1)  (14,1)
                                         (6,4,2,1)  (6,4,3,2)
                                         (7,3,2,1)  (6,5,3,1)
                                                    (7,4,3,1)
                                                    (7,5,2,1)
                                                    (8,4,2,1)
                                                    (9,3,2,1)

Ranked by A005117 (strict), A028260 (even length), and A300063 (odd sum).
Odd bisection of A067661 (non-strict: A027187).
The non-strict version is A236914.
The opposite type of strict partition (odd length and even sum) is A344650.
A000041 counts partitions of 2n with alternating sum 0, ranked by A000290.
A103919 counts partitions by sum and alternating sum (reverse: A344612).
A344610 counts partitions by sum and positive reverse-alternating sum.
Cf. A000070, A000097, A030229, A035294, A067659, A236559, A338907, A343941, A344649, A344654, A344739.

Table[Length[Select[IntegerPartitions[2n+1],UnsameQ@@#&&EvenQ[Length[#]]&]],{n,0,15}]

The Heinz numbers are A005117 /\ A028260 /\ A300063.

More terms from Bert Dobbelaere, Jun 12 2021

A347047 Smallest squarefree semiprime whose prime indices sum to n.

Original entry on oeis.org

6, 10, 14, 21, 26, 34, 38, 46, 58, 62, 74, 82, 86, 94, 106, 118, 122, 134, 142, 146, 158, 166, 178, 194, 202, 206, 214, 218, 226, 254, 262, 274, 278, 298, 302, 314, 326, 334, 346, 358, 362, 382, 386, 394, 398, 422, 446, 454, 458, 466, 478, 482, 502, 514, 526

Offset: 3

Gus Wiseman, Aug 22 2021

nonn

Compared to A001747, we have 21 instead of 22 and lack 2 and 4.
Compared to A100484 (shifted) we have 21 instead of 22 and lack 4.
Compared to A161344, we have 21 instead of 22 and lack 4 and 8.
Compared to A339114, we have 11 instead of 9 and lack 4.
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.
A squarefree semiprime (A006881) is a product of any two distinct prime numbers.

			The initial terms and their prime indices:
    6: {1,2}
   10: {1,3}
   14: {1,4}
   21: {2,4}
   26: {1,6}
   34: {1,7}
   38: {1,8}
   46: {1,9}

The opposite version (greatest instead of smallest) is A332765.
These are the minima of rows of A338905.
The nonsquarefree version is A339114 (opposite: A339115).
A001358 lists semiprimes (squarefree: A006881).
A024697 adds up semiprimes by weight (squarefree: A025129).
A056239 adds up prime indices, row sums of A112798.
A246868 gives the greatest squarefree number whose prime indices sum to n.
A320655 counts factorizations into semiprimes (squarefree: A320656).
A338898, A338912, A338913 give the prime indices of semiprimes.
A338899, A270650, A270652 give the prime indices of squarefree semiprimes.
A339116 groups squarefree semiprimes by greater factor, sums A339194.
A339362 adds up prime indices of squarefree semiprimes.
Cf. A001221, A087112, A089994, A098350, A176504, A338900, A338901, A338904, A338907/A338908, A339005, A339191.

Table[Min@@Select[Table[Times@@Prime/@y,{y,IntegerPartitions[n,{2}]}],SquareFreeQ],{n,3,50}]

from sympy import prime, sieve
def a(n):
    p = [0] + list(sieve.primerange(1, prime(n)+1))
    return min(p[i]*p[n-i] for i in range(1, (n+1)//2))
print([a(n) for n in range(3, 58)]) # Michael S. Branicky, Sep 05 2021

cp's OEIS Frontend

A339362 Sum of prime indices of the n-th squarefree semiprime.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A306145 Expansion of (1/(1 - x)) * Sum_{k>=0} x^(2*k+1) / Product_{j=1..2*k+1} (1 - x^j).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A339361 Product of prime indices of the n-th squarefree semiprime.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A343942 Number of even-length strict integer partitions of 2n+1.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

Extensions

A347047 Smallest squarefree semiprime whose prime indices sum to n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Python

A306145 Expansion of (1/(1 - x)) * Sum_{k>=0} x^(2k+1) / Product_{j=1..2k+1} (1 - x^j).