A339560 -id:A339560 - cp's OEIS frontend

A339661 Number of factorizations of n into distinct squarefree semiprimes.

1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0

Offset: 1

Gus Wiseman, Dec 19 2020

nonn

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

Also the number of strict multiset partitions of the multiset of prime factors of n, into distinct strict pairs.

			The a(n) factorizations for n = 210, 1260, 4620, 30030, 69300 are respectively 3, 2, 6, 15, 7:
  (6*35)   (6*10*21)  (6*10*77)   (6*55*91)    (6*10*15*77)
  (10*21)  (6*14*15)  (6*14*55)   (6*65*77)    (6*10*21*55)
  (14*15)             (6*22*35)   (10*33*91)   (6*10*33*35)
                      (10*14*33)  (10*39*77)   (6*14*15*55)
                      (10*21*22)  (14*33*65)   (6*15*22*35)
                      (14*15*22)  (14*39*55)   (10*14*15*33)
                                  (15*22*91)   (10*15*21*22)
                                  (15*26*77)
                                  (21*22*65)
                                  (21*26*55)
                                  (22*35*39)
                                  (26*33*35)
                                  (6*35*143)
                                  (10*21*143)
                                  (14*15*143)

Antti Karttunen, Table of n, a(n) for n = 1..69300
Index entries for sequences computed from exponents in factorization of n

Dirichlet convolution of A008836 (Liouville's lambda) with A339742.
A050326 allows all squarefree numbers, non-strict case A050320.
A320656 is the not necessarily strict version.
A320911 lists all (not just distinct) products of squarefree semiprimes.
A322794 counts uniform factorizations, such as these.
A339561 lists positions of nonzero terms.
A001055 counts factorizations, with strict case A045778.
A001358 lists semiprimes, with squarefree case A006881.
A320655 counts factorizations into semiprimes, with strict case A322353.
The following count vertex-degree partitions and give their Heinz numbers:
- A000070 counts non-multigraphical partitions of 2n (A339620).
- A209816 counts multigraphical partitions (A320924).
- A339655 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:
- 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. A001221, A005117, A007716, A028260, A280710, A300061, A320658, A320659, A320923, A330974.

bfacs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[bfacs[n/d],Min@@#>d&]],{d,Select[Rest[Divisors[n]],SquareFreeQ[#]&&PrimeOmega[#]==2&]}]];
Table[Length[bfacs[n]],{n,100}]

A280710(n) = (bigomega(n)==2*issquarefree(n)); \\ From A280710.
A339661(n, u=(1+n)) = if(1==n, 1, my(s=0); fordiv(n, d, if((d>1) && (dA280710(d), s += A339661(n/d, d))); (s)); \\ Antti Karttunen, May 02 2022

a(n) = Sum_{d|n} (-1)^A001222(d) * A339742(n/d).

More terms and secondary offset added by Antti Karttunen, May 02 2022

A339843 Number of distinct sorted degree sequences among all n-vertex half-loop-graphs without isolated vertices.

Original entry on oeis.org

1, 1, 3, 9, 29, 97, 336, 1188, 4275, 15579, 57358, 212908, 795657, 2990221, 11291665, 42814783, 162920417, 621885767, 2380348729

Offset: 0

Gus Wiseman, Dec 27 2020

In the covering case, these degree sequences, sorted in decreasing order, are the same thing as half-loop-graphical partitions (A321729). An integer partition is half-loop-graphical if it comprises the multiset of vertex-degrees of some graph with half-loops, where a half-loop is an edge with one vertex.
The following are equivalent characteristics for any positive integer n:
(1) the prime indices of n can be partitioned into distinct singletons or strict pairs, i.e., into a set of half-loops or edges;
(2) n can be factored into distinct primes or squarefree semiprimes;
(3) the prime signature of n is half-loop-graphical.

			The a(0) = 1 through a(3) = 9 sorted degree sequences:
  ()  (1)  (1,1)  (1,1,1)
           (2,1)  (2,1,1)
           (2,2)  (2,2,1)
                  (2,2,2)
                  (3,1,1)
                  (3,2,1)
                  (3,2,2)
                  (3,3,2)
                  (3,3,3)
For example, the half-loop-graphs
  {{1},{1,2},{1,3},{2,3}}
  {{1},{2},{3},{1,2},{1,3}}
both have degrees y = (3,2,2), so y is counted under a(3).

Eric Weisstein's World of Mathematics, Degree Sequence.
Gus Wiseman, Counting and ranking factorizations, factorability, and vertex-degree partitions for groupings into pairs.

See link for additional cross references.
The version for simple graphs is A004251, covering: A095268.
The non-covering version (it allows isolated vertices) is A029889.
The same partitions counted by sum are conjectured to be A321729.
These graphs are counted by A006125 shifted left, covering: A322661.
The version for full loops is A339844, covering: A339845.
These graphs are ranked by A340018 and A340019.
A006125 counts labeled simple graphs, covering: A006129.
A027187 counts partitions of even length, ranked by A028260.
A058696 counts partitions of even numbers, ranked by A300061.
A320663/A339888 count unlabeled multiset partitions into singletons/pairs.
A339659 counts graphical partitions of 2n into k parts.
Cf. A062740, A096373, A167171, A320461, A320893, A320921, A320923, A338915, A339560, A339841, A339842.

Table[Length[Union[Sort[Table[Count[Join@@#,i],{i,n}]]&/@Select[Subsets[Subsets[Range[n],{1,2}]],Union@@#==Range[n]&]]],{n,0,5}]

a(n) = A029889(n) - A029889(n-1) for n > 0. - Andrew Howroyd, Jan 10 2024

a(7)-a(18) added (using A029889) by Andrew Howroyd, Jan 10 2024

A339842 Heinz numbers of non-graphical, multigraphical integer partitions of even numbers.

Original entry on oeis.org

9, 25, 30, 49, 63, 70, 75, 84, 100, 121, 147, 154, 165, 169, 175, 189, 196, 198, 210, 220, 250, 264, 273, 280, 286, 289, 325, 343, 351, 361, 363, 364, 385, 390, 441, 442, 462, 468, 484, 490, 495, 507, 520, 525, 529, 550, 561, 588, 594, 595, 616, 624, 637, 646

Offset: 1

Gus Wiseman, Dec 27 2020

nonn

An integer partition is graphical if it comprises the multiset of vertex-degrees of some graph, and multigraphical if it comprises the multiset of vertex-degrees of some multigraph.

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.

			The sequence of terms together with their prime indices begins:
      9: {2,2}        189: {2,2,2,4}      363: {2,5,5}
     25: {3,3}        196: {1,1,4,4}      364: {1,1,4,6}
     30: {1,2,3}      198: {1,2,2,5}      385: {3,4,5}
     49: {4,4}        210: {1,2,3,4}      390: {1,2,3,6}
     63: {2,2,4}      220: {1,1,3,5}      441: {2,2,4,4}
     70: {1,3,4}      250: {1,3,3,3}      442: {1,6,7}
     75: {2,3,3}      264: {1,1,1,2,5}    462: {1,2,4,5}
     84: {1,1,2,4}    273: {2,4,6}        468: {1,1,2,2,6}
    100: {1,1,3,3}    280: {1,1,1,3,4}    484: {1,1,5,5}
    121: {5,5}        286: {1,5,6}        490: {1,3,4,4}
    147: {2,4,4}      289: {7,7}          495: {2,2,3,5}
    154: {1,4,5}      325: {3,3,6}        507: {2,6,6}
    165: {2,3,5}      343: {4,4,4}        520: {1,1,1,3,6}
    169: {6,6}        351: {2,2,2,6}      525: {2,3,3,4}
    175: {3,3,4}      361: {8,8}          529: {9,9}
For example, a complete list of all multigraphs with degrees (4,2,2,2) is:
  {{1,2},{1,2},{1,3},{1,4},{3,4}}
  {{1,2},{1,3},{1,3},{1,4},{2,4}}
  {{1,2},{1,3},{1,4},{1,4},{2,3}}
Since none of these is strict, i.e., a graph, the Heinz number 189 is in the sequence.

Eric Weisstein's World of Mathematics, Degree Sequence.
Gus Wiseman, Counting and ranking factorizations, factorability, and vertex-degree partitions for groupings into pairs.

See link for additional cross references.
Distinct prime shadows (images under A181819) of A340017.
A000070 counts non-multigraphical partitions (A339620).
A000569 counts graphical partitions (A320922).
A027187 counts partitions of even length (A028260).
A058696 counts partitions of even numbers (A300061).
A096373 cannot be partitioned into strict pairs.
A209816 counts multigraphical partitions (A320924).
A320663/A339888 count unlabeled multiset partitions into singletons/pairs.
A320893 can be partitioned into distinct pairs but not into strict pairs.
A339560 can be partitioned into distinct strict pairs.
A339617 counts non-graphical partitions of 2n (A339618).
A339659 counts graphical partitions of 2n into k parts.
Cf. A004251, A006129, A007717, A056239, A095268, A112798, A181821, A305936, A318284, A339559.

strr[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[strr[n/d],Min@@#>=d&]],{d,Select[Divisors[n],And[SquareFreeQ[#],PrimeOmega[#]==2]&]}]];
nrmptn[n_]:=Join@@MapIndexed[Table[#2[[1]],{#1}]&,If[n==1,{},Flatten[Cases[FactorInteger[n]//Reverse,{p_,k_}:>Table[PrimePi[p],{k}]]]]];
Select[Range[100],EvenQ[Length[nrmptn[#]]]&& Select[strr[Times@@Prime/@nrmptn[#]],UnsameQ@@#&]=={}&&strr[Times@@Prime/@nrmptn[#]]!={}&]

Equals A320924 /\ A339618.

Equals A320924 \ A320922.

A340104 Products of distinct primes of nonprime index (A007821).

Original entry on oeis.org

1, 2, 7, 13, 14, 19, 23, 26, 29, 37, 38, 43, 46, 47, 53, 58, 61, 71, 73, 74, 79, 86, 89, 91, 94, 97, 101, 103, 106, 107, 113, 122, 131, 133, 137, 139, 142, 146, 149, 151, 158, 161, 163, 167, 173, 178, 181, 182, 193, 194, 197, 199, 202, 203, 206, 214, 223, 226

Offset: 1

Gus Wiseman, Mar 12 2021

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 sequence of terms together with the corresponding prime indices of prime indices begins:
     1: {}              58: {{},{1,3}}        113: {{1,2,3}}
     2: {{}}            61: {{1,2,2}}         122: {{},{1,2,2}}
     7: {{1,1}}         71: {{1,1,3}}         131: {{1,1,1,1,1}}
    13: {{1,2}}         73: {{2,4}}           133: {{1,1},{1,1,1}}
    14: {{},{1,1}}      74: {{},{1,1,2}}      137: {{2,5}}
    19: {{1,1,1}}       79: {{1,5}}           139: {{1,7}}
    23: {{2,2}}         86: {{},{1,4}}        142: {{},{1,1,3}}
    26: {{},{1,2}}      89: {{1,1,1,2}}       146: {{},{2,4}}
    29: {{1,3}}         91: {{1,1},{1,2}}     149: {{3,4}}
    37: {{1,1,2}}       94: {{},{2,3}}        151: {{1,1,2,2}}
    38: {{},{1,1,1}}    97: {{3,3}}           158: {{},{1,5}}
    43: {{1,4}}        101: {{1,6}}           161: {{1,1},{2,2}}
    46: {{},{2,2}}     103: {{2,2,2}}         163: {{1,8}}
    47: {{2,3}}        106: {{},{1,1,1,1}}    167: {{2,6}}
    53: {{1,1,1,1}}    107: {{1,1,4}}         173: {{1,1,1,3}}

These primes (of nonprime index) are listed by A007821.
The non-strict version is A320628, with odd case A320629.
The odd case is A340105.
The prime instead of nonprime version:
  primes: A006450
  products: A076610
  strict: A302590
The semiprime instead of nonprime version:
  primes: A106349
  products: A339112
  strict: A340020
The squarefree semiprime instead of nonprime version:
  strict: A309356
  primes: A322551
  products: A339113
A056239 gives the sum of prime indices, which are listed by A112798.
A257994 counts prime prime indices.
A302242 is the weight of the multiset of multisets with MM-number n.
A305079 is the number of connected components for MM-number n.
A320911 lists products of squarefree semiprimes (Heinz numbers of A338914).
A320912 lists products of distinct semiprimes (Heinz numbers of A338916).
A330944 counts nonprime prime indices.
A330945 lists numbers with a nonprime prime index (nonprime case: A330948).
A339561 lists products of distinct squarefree semiprimes (A339560).
MM-numbers: A255397 (normal), A302478 (set multisystems), A320630 (set multipartitions), A302494 (sets of sets), A305078 (connected), A316476 (antichains), A318991 (chains), A320456 (covers), A328514 (connected sets of sets), A329559 (clutters), A340019 (half-loop graphs).
Cf. A000040, A000720, A001055, A001222, A003963, A005117, A007097, A018252, A289509, A320461, A320631.

Select[Range[100],SquareFreeQ[#]&&FreeQ[If[#==1,{},FactorInteger[#]],{p_,k_}/;PrimeQ[PrimePi[p]]]&]

Equals A005117 /\ A320628.

A340017 Products of squarefree semiprimes that are not products of distinct squarefree semiprimes.

Original entry on oeis.org

36, 100, 196, 216, 225, 360, 441, 484, 504, 540, 600, 676, 756, 792, 936, 1000, 1089, 1156, 1176, 1188, 1224, 1225, 1296, 1350, 1368, 1400, 1404, 1444, 1500, 1521, 1656, 1836, 1960, 2052, 2088, 2116, 2160, 2200, 2232, 2250, 2484, 2600, 2601, 2646, 2664, 2744

Offset: 1

Gus Wiseman, Dec 30 2020

nonn

Of course, every number is a product of squarefree numbers (A050320).
A squarefree semiprime (A006881) is a product of any two distinct prime numbers.
All terms have even Omega (A001222, A028260).

			The sequence of terms together with their prime indices begins:
      36: {1,1,2,2}        1000: {1,1,1,3,3,3}
     100: {1,1,3,3}        1089: {2,2,5,5}
     196: {1,1,4,4}        1156: {1,1,7,7}
     216: {1,1,1,2,2,2}    1176: {1,1,1,2,4,4}
     225: {2,2,3,3}        1188: {1,1,2,2,2,5}
     360: {1,1,1,2,2,3}    1224: {1,1,1,2,2,7}
     441: {2,2,4,4}        1225: {3,3,4,4}
     484: {1,1,5,5}        1296: {1,1,1,1,2,2,2,2}
     504: {1,1,1,2,2,4}    1350: {1,2,2,2,3,3}
     540: {1,1,2,2,2,3}    1368: {1,1,1,2,2,8}
     600: {1,1,1,2,3,3}    1400: {1,1,1,3,3,4}
     676: {1,1,6,6}        1404: {1,1,2,2,2,6}
     756: {1,1,2,2,2,4}    1444: {1,1,8,8}
     792: {1,1,1,2,2,5}    1500: {1,1,2,3,3,3}
     936: {1,1,1,2,2,6}    1521: {2,2,6,6}
For example, a complete list of all factorizations of 7560 into squarefree semiprimes is:
  7560 = (6*6*6*35) = (6*6*10*21) = (6*6*14*15),
but since none of these is strict, 7560 is in the sequence.

Eric Weisstein's World of Mathematics, Degree Sequence.
Gus Wiseman, Counting and ranking factorizations, factorability, and vertex-degree partitions for groupings into pairs.

See link for additional cross references.
The distinct prime shadows (under A181819) of these terms are A339842.
Factorizations into squarefree semiprimes are counted by A320656.
Products of squarefree semiprimes that are not products of distinct semiprimes are A320893.
Factorizations into distinct squarefree semiprimes are A339661.
For the next four lines, we list numbers with even Omega (A028260).
- A320891 cannot be factored into squarefree semiprimes.
- A320894 cannot be factored into distinct squarefree semiprimes.
- A320911 can be factored into squarefree semiprimes.
- A339561 can be factored into distinct squarefree semiprimes.
A001358 lists semiprimes, with squarefree case A006881.
A002100 counts partitions into squarefree semiprimes.
A030229 lists squarefree numbers with even Omega.
A050320 counts factorizations into squarefree numbers.
A050326 counts factorizations into distinct squarefree numbers.
A181819 is the Heinz number of the prime signature of n (prime shadow).
A320656 counts factorizations into squarefree semiprimes.
A339560 can be partitioned into distinct strict pairs.
Cf. A001055, A001222, A005117, A007717, A096373, A112798, A300061, A322353, A339559, A338899, A339740.

strr[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[strr[n/d],Min@@#>=d&]],{d,Select[Divisors[n],And[SquareFreeQ[#],PrimeOmega[#]==2]&]}]];
Select[Range[1000],Select[strr[#],UnsameQ@@#&]=={}&&strr[#]!={}&]

Equals A320894 /\ A320911.

Numbers n such that A320656(n) > 0 but A339661(n) = 0.

cp's OEIS Frontend

A339661 Number of factorizations of n into distinct squarefree semiprimes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A339843 Number of distinct sorted degree sequences among all n-vertex half-loop-graphs without isolated vertices.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A339842 Heinz numbers of non-graphical, multigraphical integer partitions of even numbers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A340104 Products of distinct primes of nonprime index (A007821).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A340017 Products of squarefree semiprimes that are not products of distinct squarefree semiprimes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula