A338898 -id:A338898 - cp's OEIS frontend

A338915 Number of integer partitions of n that have an even number of parts and cannot be partitioned into distinct pairs of not necessarily distinct parts.

0, 0, 0, 0, 1, 0, 1, 1, 4, 2, 6, 6, 12, 12, 20, 22, 38, 42, 60, 73, 101, 124, 164, 203, 266, 319, 415, 507, 649, 786, 983, 1198, 1499, 1797, 2234, 2673, 3303, 3952, 4826, 5753, 6999, 8330, 10051, 11943, 14357, 16956, 20322, 23997, 28568, 33657, 39897, 46879

Offset: 0

Gus Wiseman, Dec 10 2020

nonn

The multiplicities of such a partition form a non-loop-graphical partition (A339655, A339657).

			The a(7) = 1 through a(12) = 12 partitions:
  211111  2222      411111    222211      222221      3333
          221111    21111111  331111      611111      222222
          311111              511111      22211111    441111
          11111111            22111111    32111111    711111
                              31111111    41111111    22221111
                              1111111111  2111111111  32211111
                                                      33111111
                                                      42111111
                                                      51111111
                                                      2211111111
                                                      3111111111
                                                      111111111111
For example, the partition y = (3,2,2,1,1,1,1,1) can be partitioned into pairs in just three ways:
  {{1,1},{1,1},{1,2},{2,3}}
  {{1,1},{1,1},{1,3},{2,2}}
  {{1,1},{1,2},{1,2},{1,3}}
None of these is strict, so y is counted under a(12).

Eric Weisstein's World of Mathematics, Graphical partition.

The Heinz numbers of these partitions are A320892.
The complement in even-length partitions is A338916.
A000070 counts non-multigraphical partitions of 2n, ranked by A339620.
A000569 counts graphical partitions, ranked by A320922.
A001358 lists semiprimes, with squarefree case A006881.
A058696 counts partitions of even numbers, ranked by A300061.
A209816 counts multigraphical partitions, ranked by A320924.
A320655 counts factorizations into semiprimes.
A322353 counts factorizations into distinct semiprimes.
A339617 counts non-graphical partitions of 2n, ranked by A339618.
A339655 counts non-loop-graphical partitions of 2n, ranked by A339657.
A339656 counts loop-graphical partitions, ranked by A339658.
The following count partitions of even length and give their Heinz numbers:
- A027187 has no additional conditions (A028260).
- A096373 cannot be partitioned into strict pairs (A320891).
- A338914 can be partitioned into strict pairs (A320911).
- A338916 can be partitioned into distinct pairs (A320912).
- A339559 cannot be partitioned into distinct strict pairs (A320894).
- A339560 can be partitioned into distinct strict pairs (A339561).
Cf. A001055, A007717, A025065, A320656, A320732, A320893, A338898, A338902.

smcs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[smcs[n/d],Min@@#>d&]],{d,Select[Rest[Divisors[n]],PrimeOmega[#]==2&]}]];
Table[Length[Select[IntegerPartitions[n],EvenQ[Length[#]]&&smcs[Times@@Prime/@#]=={}&]],{n,0,10}]

A027187(n) = a(n) + A338916(n).

More terms from Jinyuan Wang, Feb 14 2025

A112141 Product of the first n semiprimes.

Original entry on oeis.org

4, 24, 216, 2160, 30240, 453600, 9525600, 209563200, 5239080000, 136216080000, 4495130640000, 152834441760000, 5349205461600000, 203269807540800000, 7927522494091200000, 364666034728195200000, 17868635701681564800000, 911300420785759804800000

Offset: 1

Jonathan Vos Post, Nov 28 2005

Semiprime analog of primorial (A002110). Equivalent for product of what A062198 is for sum.

			a(10) = 4*6*9*10*14*15*21*22*25*26 = 136216080000, the product of the first 10 semiprimes.
From _Gus Wiseman_, Dec 06 2020: (Start)
The sequence of terms together with their prime signatures begins:
                        4: (2)
                       24: (3,1)
                      216: (3,3)
                     2160: (4,3,1)
                    30240: (5,3,1,1)
                   453600: (5,4,2,1)
                  9525600: (5,5,2,2)
                209563200: (6,5,2,2,1)
               5239080000: (6,5,4,2,1)
             136216080000: (7,5,4,2,1,1)
            4495130640000: (7,6,4,2,2,1)
          152834441760000: (8,6,4,2,2,1,1)
         5349205461600000: (8,6,5,3,2,1,1)
       203269807540800000: (9,6,5,3,2,1,1,1)
      7927522494091200000: (9,7,5,3,2,2,1,1)
    364666034728195200000: (10,7,5,3,2,2,1,1,1)
  17868635701681564800000: (10,7,5,5,2,2,1,1,1)
(End)

T. D. Noe, Table of n, a(n) for n = 1..100

Partial sums of semiprimes are A062198.
First differences of semiprimes are A065516.
A000040 lists primes, with partial products A002110 (primorials).
A000142 lists factorials, with partial products A000178 (superfactorials).
A001358 lists semiprimes, with partial products A112141 (this sequence).
A005117 lists squarefree numbers, with partial products A111059.
A006881 lists squarefree semiprimes, with partial products A339191.
A101048 counts partitions into semiprimes (restricted: A338902).
A320655 counts factorizations into semiprimes.
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.
Cf. A001222, A084126, A084127, A115392, A168472, A320732, A320892.

A112141 := proc(n)
    mul(A001358(i),i=1..n) ;
end proc:
seq(A112141(n),n=1..10) ; # R. J. Mathar, Jun 30 2020

NextSemiPrime[n_, k_: 1] := Block[{c = 0, sgn = Sign[k]}, sp = n + sgn; While[c < Abs[k], While[ PrimeOmega[sp] != 2, If[sgn < 0, sp--, sp++]]; If[sgn < 0, sp--, sp++]; c++]; sp + If[sgn < 0, 1, -1]]; f[n_] := Times @@ NestList[ NextSemiPrime@# &, 2^2, n - 1]; Array[f, 18] (* Robert G. Wilson v, Jun 13 2013 *)
FoldList[Times,Select[Range[30],PrimeOmega[#]==2&]] (* Gus Wiseman, Dec 06 2020 *)

a(n)=my(v=vector(n),i,k=3);while(iCharles R Greathouse IV, Apr 04 2013

from sympy import factorint
def aupton(terms):
    alst, k, p = [], 1, 1
    while len(alst) < terms:
        if sum(factorint(k).values()) == 2:
            p *= k
            alst.append(p)
        k += 1
    return alst
print(aupton(18)) # Michael S. Branicky, Aug 31 2021

a(n) = Product_{i=1..n} A001358(i).

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

A338901 Position of the first appearance of prime(n) as a factor in the list of squarefree semiprimes.

Original entry on oeis.org

1, 1, 2, 3, 6, 7, 9, 11, 13, 17, 18, 21, 23, 25, 29, 31, 34, 36, 40, 42, 45, 47, 50, 52, 56, 58, 61, 64, 67, 70, 76, 78, 81, 82, 86, 89, 93, 97, 100, 104, 106, 107, 112, 113, 116, 118, 125, 129, 133, 134, 135, 139, 141, 147, 150, 154, 159, 160, 165, 167, 169

Offset: 1

Gus Wiseman, Nov 16 2020

nonn

The a(n)-th squarefree semiprime is the first divisible by prime(n).

After a(1) = 1, these are the positions of even terms in the list of all squarefree semiprimes A006881.

Amiram Eldar, Table of n, a(n) for n = 1..10000

A001358 lists semiprimes, with odds A046315 and evens A100484.
A004526 counts 2-part partitions, with strict case A140106 (shifted left).
A005117 lists squarefree numbers.
A006881 lists squarefree semiprimes, with odds A046388 and evens A100484.
A115392 is the not necessarily squarefree version.
A166237 gives the first differences of squarefree semiprimes.
A270650 and A270652 give the prime indices of squarefree semiprimes.
A320656 counts factorizations into squarefree semiprimes.
A338898 gives prime indices of semiprimes, with differences A176506.
A338899 gives prime indices of squarefree semiprimes, differences A338900.
A338912 and A338913 give the prime indices of semiprimes.
Cf. A001221, A001222, A002100, A056239, A065516, A112798, A167171, A320891, A320911, A338903, A338905.

rs=First/@FactorInteger[#]&/@Select[Range[100],SquareFreeQ[#]&&PrimeOmega[#]==2&];
Table[Position[rs,i][[1,1]],{i,Union@@rs}]

A006881(a(n)) = A100484(n).

A338916 Number of integer partitions of n that can be partitioned into distinct pairs of (possibly equal) parts.

Original entry on oeis.org

1, 0, 1, 1, 2, 3, 5, 6, 8, 12, 16, 21, 28, 37, 49, 64, 80, 104, 135, 169, 216, 268, 341, 420, 527, 654, 809, 991, 1218, 1488, 1828, 2213, 2687, 3262, 3934, 4754, 5702, 6849, 8200, 9819, 11693, 13937, 16562, 19659, 23262, 27577, 32493, 38341, 45112, 53059, 62265

Offset: 0

Gus Wiseman, Dec 10 2020

nonn

The multiplicities of such a partition form a loop-graphical partition (A339656, A339658).

			The a(2) = 1 through a(10) = 16 partitions:
  (11)  (21)  (22)  (32)    (33)    (43)    (44)    (54)      (55)
              (31)  (41)    (42)    (52)    (53)    (63)      (64)
                    (2111)  (51)    (61)    (62)    (72)      (73)
                            (2211)  (2221)  (71)    (81)      (82)
                            (3111)  (3211)  (3221)  (3222)    (91)
                                    (4111)  (3311)  (3321)    (3322)
                                            (4211)  (4221)    (3331)
                                            (5111)  (4311)    (4222)
                                                    (5211)    (4321)
                                                    (6111)    (4411)
                                                    (222111)  (5221)
                                                    (321111)  (5311)
                                                              (6211)
                                                              (7111)
                                                              (322111)
                                                              (421111)
For example, the partition (4,2,1,1,1,1) can be partitioned into {{1,1},{1,2},{1,4}}, and thus is counted under a(10).

Eric Weisstein's World of Mathematics, Graphical partition.

A320912 gives the Heinz numbers of these partitions.
A338915 counts the complement in even-length partitions.
A339563 counts factorizations of the same type.
A000070 counts non-multigraphical partitions of 2n, ranked by A339620.
A000569 counts graphical partitions, ranked by A320922.
A001358 lists semiprimes, with squarefree case A006881.
A058696 counts partitions of even numbers, ranked by A300061.
A209816 counts multigraphical partitions, ranked by A320924.
A320655 counts factorizations into semiprimes.
A322353 counts factorizations into distinct semiprimes.
A339617 counts non-graphical partitions of 2n, ranked by A339618.
A339655 counts non-loop-graphical partitions of 2n, ranked by A339657.
A339656 counts loop-graphical partitions, ranked by A339658.
The following count partitions of even length and give their Heinz numbers:
- A027187 has no additional conditions (A028260).
- A096373 cannot be partitioned into strict pairs (A320891).
- A338914 can be partitioned into strict pairs (A320911).
- A338915 cannot be partitioned into distinct pairs (A320892).
- A339559 cannot be partitioned into distinct strict pairs (A320894).
- A339560 can be partitioned into distinct strict pairs (A339561).
Cf. A001055, A007717, A025065, A320656, A320732, A320893, A320921, A338898, A338902, A339564.

stfs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[stfs[n/d],Min@@#>d&]],{d,Select[Rest[Divisors[n]],PrimeOmega[#]==2&]}]];
Table[Length[Select[IntegerPartitions[n],stfs[Times@@Prime/@#]!={}&]],{n,0,20}]

A027187(n) = a(n) + A338915(n).

More terms from Jinyuan Wang, Feb 14 2025

A339655 Number of non-loop-graphical integer partitions of 2n.

Original entry on oeis.org

0, 0, 1, 3, 7, 14, 28, 51, 91, 156, 260, 425, 680, 1068, 1654, 2524, 3802, 5668, 8350, 12190, 17634, 25306, 36011, 50902, 71441, 99642

Offset: 0

Gus Wiseman, Dec 14 2020

An integer partition is loop-graphical if it comprises the multiset of vertex-degrees of some graph with loops, where a loop is an edge with equal source and target. See A339657 for the Heinz numbers, and A339656 for the complement.
The following are equivalent characteristics for any positive integer n:
(1) the prime factors of n can be partitioned into distinct pairs;
(2) n can be factored into distinct semiprimes;
(3) the prime signature of n is loop-graphical.

			The a(2) = 1 through a(5) = 14 partitions (A = 10):
  (4)  (6)    (8)      (A)
       (4,2)  (4,4)    (5,5)
       (5,1)  (5,3)    (6,4)
              (6,2)    (7,3)
              (7,1)    (8,2)
              (5,2,1)  (9,1)
              (6,1,1)  (5,3,2)
                       (5,4,1)
                       (6,2,2)
                       (6,3,1)
                       (7,2,1)
                       (8,1,1)
                       (6,2,1,1)
                       (7,1,1,1)
For example, the seven normal loop-multigraphs with degrees y = (5,3,2) are:
  {{1,1},{1,1},{1,2},{2,2},{3,3}}
  {{1,1},{1,1},{1,2},{2,3},{2,3}}
  {{1,1},{1,1},{1,3},{2,2},{2,3}}
  {{1,1},{1,2},{1,2},{1,2},{3,3}}
  {{1,1},{1,2},{1,2},{1,3},{2,3}}
  {{1,1},{1,2},{1,3},{1,3},{2,2}}
  {{1,2},{1,2},{1,2},{1,3},{1,3}},
but since none of these is a loop-graph (because they are not strict), y is counted under a(5).

Eric Weisstein's World of Mathematics, Graphical partition.

A001358 lists semiprimes, with squarefree case A006881.
A006125 counts labeled graphs, with covering case A006129.
A062740 counts labeled connected loop-graphs.
A101048 counts partitions into semiprimes.
A320461 ranks normal loop-graphs.
A322661 counts covering loop-graphs.
A320655 counts factorizations into semiprimes.
The following count vertex-degree partitions and give their Heinz numbers:
- A058696 counts partitions of 2n (A300061).
- A000070 counts non-multigraphical partitions of 2n (A339620).
- A209816 counts multigraphical partitions (A320924).
- A339655 (this sequence) counts non-loop-graphical partitions of 2n (A339657).
- A339656 counts loop-graphical partitions (A339658).
- A339617 counts non-graphical partitions of 2n (A339618).
- A000569 counts graphical partitions (A320922).
The following count partitions of even length and give their Heinz numbers:
- A027187 has no additional conditions (A028260).
- A096373 cannot be partitioned into strict pairs (A320891).
- A338914 can be partitioned into strict pairs (A320911).
- A338915 cannot be partitioned into distinct pairs (A320892).
- A338916 can be partitioned into distinct pairs (A320912).
- A339559 cannot be partitioned into distinct strict pairs (A320894).
- A339560 can be partitioned into distinct strict pairs (A339561).
Cf. A007717, A025065, A147878, A320732, A320921, A338898, A338902, A338912, A338913, A339659, A339660, A339662.

spsbin[{}]:={{}};spsbin[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@spsbin[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
mpsbin[set_]:=Union[Sort[Sort/@(#/.x_Integer:>set[[x]])]&/@spsbin[Range[Length[set]]]];
strnorm[n_]:=Flatten[MapIndexed[Table[#2,{#1}]&,#]]&/@IntegerPartitions[n];
Table[Length[Select[strnorm[2*n],Select[mpsbin[#],UnsameQ@@#&]=={}&]],{n,0,5}]

A058696(n) = a(n) + A339656(n).

a(7)-a(25) from Andrew Howroyd, Jan 10 2024

A339658 Heinz numbers of loop-graphical partitions (of even numbers).

Original entry on oeis.org

1, 3, 4, 9, 10, 12, 16, 25, 27, 28, 30, 36, 40, 48, 63, 64, 70, 75, 81, 84, 88, 90, 100, 108, 112, 120, 144, 147, 160, 175, 189, 192, 196, 198, 208, 210, 220, 225, 243, 250, 252, 256, 264, 270, 280, 300, 324, 336, 343, 352, 360, 400, 432, 441, 448, 462, 468, 480

Offset: 1

Gus Wiseman, Dec 18 2020

nonn

Equals the image of A181819 applied to the set of terms of A320912.
The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.
A partition is loop-graphical if it comprises the multiset of vertex-degrees of some graph with loops, where a loop is an edge with two equal vertices. Loop-graphical partitions are counted by A339656.
The following are equivalent characteristics for any positive integer n:
(1) the prime factors of n can be partitioned into distinct pairs;
(2) n can be factored into distinct semiprimes;
(3) the prime signature of n is loop-graphical.

			The sequence of terms > 1 together with their prime indices begins:
      3: {2}               70: {1,3,4}          192: {1,1,1,1,1,1,2}
      4: {1,1}             75: {2,3,3}          196: {1,1,4,4}
      9: {2,2}             81: {2,2,2,2}        198: {1,2,2,5}
     10: {1,3}             84: {1,1,2,4}        208: {1,1,1,1,6}
     12: {1,1,2}           88: {1,1,1,5}        210: {1,2,3,4}
     16: {1,1,1,1}         90: {1,2,2,3}        220: {1,1,3,5}
     25: {3,3}            100: {1,1,3,3}        225: {2,2,3,3}
     27: {2,2,2}          108: {1,1,2,2,2}      243: {2,2,2,2,2}
     28: {1,1,4}          112: {1,1,1,1,4}      250: {1,3,3,3}
     30: {1,2,3}          120: {1,1,1,2,3}      252: {1,1,2,2,4}
     36: {1,1,2,2}        144: {1,1,1,1,2,2}    256: {1,1,1,1,1,1,1,1}
     40: {1,1,1,3}        147: {2,4,4}          264: {1,1,1,2,5}
     48: {1,1,1,1,2}      160: {1,1,1,1,1,3}    270: {1,2,2,2,3}
     63: {2,2,4}          175: {3,3,4}          280: {1,1,1,3,4}
     64: {1,1,1,1,1,1}    189: {2,2,2,4}        300: {1,1,2,3,3}
For example, the four loop-graphs with degrees y = (3,1,1,1) are:
  {{1,1},{1,2},{3,4}}
  {{1,1},{1,3},{2,4}}
  {{1,1},{1,4},{2,3}}
  {{1,2},{1,3},{1,4}},
so the Heinz number 40 is in the sequence. On the other hand, the three loop-multigraphs with degrees y = (4,4) are
  {{1,1},{1,1},{2,2},{2,2}}
  {{1,1},{1,2},{1,2},{2,2}}
  {{1,2},{1,2},{1,2},{1,2}},
but none of these is a loop-graph, so the Heinz number 49 is not in the sequence.

Eric Weisstein's World of Mathematics, Graphical partition.

A320912 has these prime shadows (see A181819).
A339656 counts these partitions.
A339657 ranks the complement, counted by A339655.
A001358 lists semiprimes, with squarefree case A006881.
A101048 counts partitions into semiprimes.
A320655 counts factorizations into semiprimes.
The following count vertex-degree partitions and give their Heinz numbers:
- A058696 counts partitions of 2n (A300061).
- A209816 counts multigraphical partitions (A320924).
- A000569 counts graphical partitions (A320922).
The following count partitions of even length and give their Heinz numbers:
- A027187 has no additional conditions (A028260).
- A338914 can be partitioned into strict pairs (A320911).
- A338916 can be partitioned into distinct pairs (A320912).
- A339560 can be partitioned into distinct strict pairs (A339561).
Cf. A001055, A001221, A001222, A007717, A056239, A112798, A320732, A320892, A338898, A338912, A338913, A339112.

spsbin[{}]:={{}};spsbin[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@spsbin[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
mpsbin[set_]:=Union[Sort[Sort/@(#/.x_Integer:>set[[x]])]&/@spsbin[Range[Length[set]]]];
nrmptn[n_]:=Join@@MapIndexed[Table[#2[[1]],{#1}]&,If[n==1,{},Flatten[Cases[FactorInteger[n]//Reverse,{p_,k_}:>Table[PrimePi[p],{k}]]]]];
Select[Range[25],Select[mpsbin[nrmptn[#]],UnsameQ@@#&]!={}&]

A300061 = A339657 \/ A339658.

A339114 Least semiprime whose prime indices sum to n.

Original entry on oeis.org

4, 6, 9, 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: 2

Gus Wiseman, Nov 28 2020

nonn

Converges to A100484.
After a(4) = 9, also the least squarefree semiprime whose prime indices sum to n.
A semiprime is a product of any two 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 terms together with their prime indices begins:
      4: {1,1}     106: {1,16}    254: {1,31}
      6: {1,2}     118: {1,17}    262: {1,32}
      9: {2,2}     122: {1,18}    274: {1,33}
     14: {1,4}     134: {1,19}    278: {1,34}
     21: {2,4}     142: {1,20}    298: {1,35}
     26: {1,6}     146: {1,21}    302: {1,36}
     34: {1,7}     158: {1,22}    314: {1,37}
     38: {1,8}     166: {1,23}    326: {1,38}
     46: {1,9}     178: {1,24}    334: {1,39}
     58: {1,10}    194: {1,25}    346: {1,40}
     62: {1,11}    202: {1,26}    358: {1,41}
     74: {1,12}    206: {1,27}    362: {1,42}
     82: {1,13}    214: {1,28}    382: {1,43}
     86: {1,14}    218: {1,29}    386: {1,44}
     94: {1,15}    226: {1,30}    394: {1,45}

A024697 is the sum of the same semiprimes.
A098350 has this sequence as antidiagonal minima.
A338904 has this sequence as row minima.
A339114 (this sequence) is the squarefree case for n > 4.
A339115 is the greatest among the same semiprimes.
A001358 lists semiprimes, with odd/even terms A046315/A100484.
A006881 lists squarefree semiprimes, with odd/even terms A046388/A100484.
A037143 lists primes and semiprimes.
A056239 gives the sum of prime indices of n.
A084126 and A084127 give the prime factors of semiprimes.
A087112 groups semiprimes by greater factor.
A320655 counts factorizations into semiprimes.
A332765/A332877 is the greatest squarefree semiprime of weight n.
A338898, A338912, and A338913 give the prime indices of semiprimes, with product A087794, sum A176504, and difference A176506.
A338899, A270650, and A270652 give the prime indices of squarefree semiprimes, with difference A338900.
A338907/A338906 list semiprimes of odd/even weight.
A338907/A338908 list squarefree semiprimes of odd/even weight.
Cf. A000040, A001221, A001222, A014342, A025129, A062198, A112798, A338905, A339116.

Table[Min@@Table[Prime[k]*Prime[n-k],{k,n-1}],{n,2,30}]
Take[DeleteDuplicates[SortBy[{Times@@#,Total[PrimePi[#]]}&/@Tuples[ Prime[ Range[ 200]],2],{Last,First}],GreaterEqual[#1[[2]],#2[[2]]]&][[All,1]],60] (* Harvey P. Dale, Sep 06 2022 *)

a(n) = vecmin(vector(n-1, k, prime(k)*prime(n-k))); \\ Michel Marcus, Dec 03 2020

A339116 Triangle of all squarefree semiprimes grouped by greater prime factor, read by rows.

Original entry on oeis.org

6, 10, 15, 14, 21, 35, 22, 33, 55, 77, 26, 39, 65, 91, 143, 34, 51, 85, 119, 187, 221, 38, 57, 95, 133, 209, 247, 323, 46, 69, 115, 161, 253, 299, 391, 437, 58, 87, 145, 203, 319, 377, 493, 551, 667, 62, 93, 155, 217, 341, 403, 527, 589, 713, 899

Offset: 2

Gus Wiseman, Dec 01 2020

A squarefree semiprime is a product of any two distinct prime numbers.

			Triangle begins:
   6
  10  15
  14  21  35
  22  33  55  77
  26  39  65  91 143
  34  51  85 119 187 221
  38  57  95 133 209 247 323
  46  69 115 161 253 299 391 437
  58  87 145 203 319 377 493 551 667
  62  93 155 217 341 403 527 589 713 899

Andrew Howroyd, Table of n, a(n) for n = 2..1276 (first 50 rows)

A339194 gives row sums.
A100484 is column k = 1.
A001748 is column k = 2.
A001750 is column k = 3.
A006094 is column k = n - 1.
A090076 is column k = n - 2.
A319613 is the central column k = 2*n.
A087112 is the not necessarily squarefree version.
A338905 is a different triangle of squarefree semiprimes.
A339195 is the generalization to all squarefree numbers, row sums A339360.
A001358 lists semiprimes.
A005117 lists squarefree numbers.
A006881 lists squarefree semiprimes, with odd terms A046388.
A024697 is the sum of semiprimes of weight n.
A025129 is the sum of squarefree semiprimes of weight n.
A332765 gives the greatest squarefree semiprime of weight n.
A338898/A338912/A338913 give the prime indices of semiprimes, with product A087794, sum A176504, and difference A176506.
A338899/A270650/A270652 give the prime indices of squarefree semiprimes, with difference A338900.
A338904 groups semiprimes by weight.
A338907/A338908 list squarefree semiprimes of odd/even weight.
Cf. A000040, A001221, A014342, A098350, A112798, A168472, A320656, A338901, A339003, A339114/A339115.
Subsequence of A019565.

Table[Prime[i]*Prime[j],{i,2,10},{j,i-1}]

row(n) = {prime(n)*primes(n-1)}
{ for(n=2, 10, print(row(n))) } \\ Andrew Howroyd, Jan 19 2023

T(n,k) = prime(n) * prime(k) for k < n.

Offset corrected by Andrew Howroyd, Jan 19 2023

A339657 Heinz numbers of non-loop-graphical partitions of even numbers.

Original entry on oeis.org

7, 13, 19, 21, 22, 29, 34, 37, 39, 43, 46, 49, 52, 53, 55, 57, 61, 62, 66, 71, 76, 79, 82, 85, 87, 89, 91, 94, 101, 102, 107, 111, 113, 115, 116, 117, 118, 121, 129, 130, 131, 133, 134, 136, 138, 139, 146, 148, 151, 154, 155, 156, 159, 163, 165, 166, 169, 171

Offset: 1

Gus Wiseman, Dec 18 2020

nonn

Equals the image of A181819 applied to the set of terms of A320892.
The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.
An integer partition is loop-graphical if it comprises the multiset of vertex-degrees of some graph with loops, where a loop is an edge with two equal vertices. Loop-graphical partitions are counted by A339656, with Heinz numbers A339658.
The following are equivalent characteristics for any positive integer n:
(1) the prime factors of n can be partitioned into distinct pairs, i.e., into a set of edges and loops;
(2) n can be factored into distinct semiprimes;
(3) the prime signature of n is loop-graphical.

			The sequence of terms together with their prime indices begins:
      7: {4}         57: {2,8}      107: {28}
     13: {6}         61: {18}       111: {2,12}
     19: {8}         62: {1,11}     113: {30}
     21: {2,4}       66: {1,2,5}    115: {3,9}
     22: {1,5}       71: {20}       116: {1,1,10}
     29: {10}        76: {1,1,8}    117: {2,2,6}
     34: {1,7}       79: {22}       118: {1,17}
     37: {12}        82: {1,13}     121: {5,5}
     39: {2,6}       85: {3,7}      129: {2,14}
     43: {14}        87: {2,10}     130: {1,3,6}
     46: {1,9}       89: {24}       131: {32}
     49: {4,4}       91: {4,6}      133: {4,8}
     52: {1,1,6}     94: {1,15}     134: {1,19}
     53: {16}       101: {26}       136: {1,1,1,7}
     55: {3,5}      102: {1,2,7}    138: {1,2,9}
For example, the three loop-multigraphs with degrees y = (5,2,1) are:
  {{1,1},{1,1},{1,2},{2,3}}
  {{1,1},{1,1},{1,3},{2,2}}
  {{1,1},{1,2},{1,2},{1,3}},
but since none of these is a loop-graph (they have multiple edges), the Heinz number 66 is in the sequence.

Eric Weisstein's World of Mathematics, Graphical partition.

A320892 has these prime shadows (see A181819).
A321728 is conjectured to be the version for half-loops {x} instead of loops {x,x}.
A339655 counts these partitions.
A339658 ranks the complement, counted by A339656.
A001358 lists semiprimes, with odd and even terms A046315 and A100484.
A006881 lists squarefree semiprimes, with odd and even terms A046388 and A100484.
A101048 counts partitions into semiprimes.
A320655 counts factorizations into semiprimes.
A320656 counts factorizations into squarefree semiprimes.
A339844 counts loop-graphical partitions by length.
factorizations of n into distinct primes or squarefree semiprimes.
The following count vertex-degree partitions and give their Heinz numbers:
- A058696 counts partitions of 2n (A300061).
- A000070 counts non-multigraphical partitions of 2n (A339620).
- A209816 counts multigraphical partitions (A320924).
- A339655 counts non-loop-graphical partitions of 2n (A339657 [this sequence]).
- A339656 counts loop-graphical partitions (A339658).
- A339617 counts non-graphical partitions of 2n (A339618).
- A000569 counts graphical partitions (A320922).
The following count partitions of even length and give their Heinz numbers:
- A027187 has no additional conditions (A028260).
- A096373 cannot be partitioned into strict pairs (A320891).
- A338914 can be partitioned into strict pairs (A320911).
- A338915 cannot be partitioned into distinct pairs (A320892).
- A338916 can be partitioned into distinct pairs (A320912).
- A339559 cannot be partitioned into distinct strict pairs (A320894).
- A339560 can be partitioned into distinct strict pairs (A339561).
Cf. A001055, A001221, A001222, A007717, A056239, A112798, A320732, A338898, A338912, A338913, A339742, A339839.

spsbin[{}]:={{}};spsbin[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@spsbin[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
mpsbin[set_]:=Union[Sort[Sort/@(#/.x_Integer:>set[[x]])]&/@spsbin[Range[Length[set]]]];
nrmptn[n_]:=Join@@MapIndexed[Table[#2[[1]],{#1}]&,If[n==1,{},Flatten[Cases[FactorInteger[n]//Reverse,{p_,k_}:>Table[PrimePi[p],{k}]]]]];
Select[Range[50],EvenQ[Length[nrmptn[#]]]&&Select[mpsbin[nrmptn[#]],UnsameQ@@#&]=={}&]

A300061 = A339657 \/ A339658.

A332765 Consider all permutations p_i of the first n primes; a(n) is the minimum over p_i of the maximal product of two adjacent primes in the permutation.

Original entry on oeis.org

6, 10, 15, 22, 35, 55, 77, 91, 143, 187, 221, 253, 323, 391, 493, 551, 667, 713, 899, 1073, 1189, 1271, 1517, 1591, 1763, 1961, 2183, 2419, 2537, 2773, 3127, 3233, 3599, 3953, 4189, 4331, 4757, 4897, 5293, 5723, 5963, 6499, 6887, 7171, 7663, 8051, 8633, 8989, 9797, 9991, 10403, 10807

Offset: 2

Bobby Jacobs, Apr 23 2020

nonn

The optimal permutation of n primes is {p_n, p_1, p_n-1, p_2, …, p_ceiling(n/2)}. - Ivan N. Ianakiev, Apr 28 2020

Also the greatest squarefree semiprime whose prime indices sum to n + 1. 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. - Gus Wiseman, Dec 06 2020

			Here are the ways (up to reversal) to order the first four primes:
  2, 3, 5, 7: Products: 6, 15, 35;  Largest product: 35
  2, 3, 7, 5: Products: 6, 21, 35;  Largest product: 35
  2, 5, 3, 7: Products: 10, 15, 21; Largest product: 21
  2, 5, 7, 3: Products: 10, 35, 21; Largest product: 35
  2, 7, 3, 5: Products: 14, 21, 15; Largest product: 21
  2, 7, 5, 3: Products: 14, 35, 15; Largest product: 35
  3, 2, 5, 7: Products: 6, 10, 35;  Largest product: 35
  3, 2, 7, 5: Products: 6, 14, 35;  Largest product: 35
  3, 5, 2, 7: Products: 15, 10, 14; Largest product: 15
  3, 7, 2, 5: Products: 21, 14, 10; Largest product: 21
  5, 2, 3, 7: Products: 10, 6, 21;  Largest product: 21
  5, 3, 2, 7: Products: 15, 6, 14;  Largest product: 15
The minimum largest product is 15, so a(4) = 15.
From _Gus Wiseman_, Dec 06 2020: (Start)
The sequence of terms together with their prime indices begins:
      6: {1,2}     551: {8,10}    3127: {16,17}
     10: {1,3}     667: {9,10}    3233: {16,18}
     15: {2,3}     713: {9,11}    3599: {17,18}
     22: {1,5}     899: {10,11}   3953: {17,19}
     35: {3,4}    1073: {10,12}   4189: {17,20}
     55: {3,5}    1189: {10,13}   4331: {18,20}
     77: {4,5}    1271: {11,13}   4757: {19,20}
     91: {4,6}    1517: {12,13}   4897: {17,23}
    143: {5,6}    1591: {12,14}   5293: {19,22}
    187: {5,7}    1763: {13,14}   5723: {17,25}
    221: {6,7}    1961: {12,16}   5963: {19,24}
    253: {5,9}    2183: {12,17}   6499: {19,25}
    323: {7,8}    2419: {13,17}   6887: {20,25}
    391: {7,9}    2537: {14,17}   7171: {20,26}
    493: {7,10}   2773: {15,17}   7663: {22,25}
(End)

Cf. A332877, A333747.
A338904 and A338905 have this sequence as row maxima.
A339115 is the not necessarily squarefree version.
A001358 lists semiprimes.
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.
A320656 counts factorizations into squarefree semiprimes.
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.
A338907/A338908 list squarefree semiprimes of odd/even weight.
A339114 is the least (squarefree) semiprime of weight n.
A339116 groups squarefree semiprimes by greater prime factor.
Cf. A001221, A014342, A024697, A046388, A062198, A098350, A112798, A168472, A320655, A338901.

primes[n_]:=Reverse[Prime/@Range[n]]; partition[n_]:=Partition[primes[n],UpTo[Ceiling[n/2]]];
riffle[n_]:=Riffle[partition[n][[1]],Reverse[partition[n][[2]]]];
a[n_]:=Max[Table[riffle[n][[i]]*riffle[n][[i+1]],{i,1,n-1}]];a/@Range[2,53]
(* Ivan N. Ianakiev, Apr 28 2020 *)

It appears that a(n) = A332877(n - 1) for n > 5.

a(12)-a(13) from Jinyuan Wang, Apr 24 2020

More terms from Ivan N. Ianakiev, Apr 28 2020

cp's OEIS Frontend

A338915 Number of integer partitions of n that have an even number of parts and cannot be partitioned into distinct pairs of not necessarily distinct parts.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A112141 Product of the first n semiprimes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Python

Formula

A338901 Position of the first appearance of prime(n) as a factor in the list of squarefree semiprimes.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A338916 Number of integer partitions of n that can be partitioned into distinct pairs of (possibly equal) parts.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A339655 Number of non-loop-graphical integer partitions of 2n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A339658 Heinz numbers of loop-graphical partitions (of even numbers).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A339114 Least semiprime whose prime indices sum to n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs