A320461 -id:A320461 - cp's OEIS frontend

A340018 MM-numbers of labeled graphs with half-loops covering an initial interval of positive integers, without isolated vertices.

1, 3, 13, 15, 39, 65, 141, 143, 145, 165, 195, 377, 429, 435, 611, 705, 715, 1131, 1363, 1551, 1595, 1833, 1885, 1937, 2021, 2117, 2145, 2235, 2365, 2397, 2409, 2431, 2465, 2805, 3055, 4089, 4147, 4785, 5655, 5811, 6063, 6149, 6235, 6351, 6409, 6721, 6815

Offset: 1

Gus Wiseman, Jan 02 2021

nonn

Here a half-loop is an edge with only one vertex, to be distinguished from a full loop, which has two equal vertices.
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 multiset of multisets with MM-number n is formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. For example, the prime indices of 78 are {1,2,6}, so the multiset of multisets with MM-number 78 is {{},{1},{1,2}}.
Also products of distinct primes whose prime indices are either themselves prime or a squarefree semiprime, and whose prime indices together cover an initial interval of positive integers. A squarefree semiprime (A006881) is a product of any two distinct prime numbers.

			The sequence of terms together with their corresponding multisets of multisets (edge sets) begins:
     1: {}
     3: {{1}}
    13: {{1,2}}
    15: {{1},{2}}
    39: {{1},{1,2}}
    65: {{2},{1,2}}
   141: {{1},{2,3}}
   143: {{3},{1,2}}
   145: {{2},{1,3}}
   165: {{1},{2},{3}}
   195: {{1},{2},{1,2}}
   377: {{1,2},{1,3}}
   429: {{1},{3},{1,2}}
   435: {{1},{2},{1,3}}
   611: {{1,2},{2,3}}
   705: {{1},{2},{2,3}}
   715: {{2},{3},{1,2}}
  1131: {{1},{1,2},{1,3}}

The version with full loops is A320461.
The version not necessarily covering an initial interval is A340019.
MM-numbers of graphs with loops are A340020.
A006450 lists primes of prime index.
A106349 lists primes of semiprime index.
A257994 counts prime prime indices.
A302242 is the weight of the multiset of multisets with MM-number n.
A302494 lists MM-numbers of sets of sets, with connected case A328514.
A309356 lists MM-numbers of simple graphs.
A322551 lists primes of squarefree semiprime index.
A339112 lists MM-numbers of multigraphs with loops.
A339113 lists MM-numbers of multigraphs.
Cf. A000040, A000720, A001222, A005117, A056239, A076610, A112798, A289509, A302590, A305079, A326754, A326788.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
normQ[sys_]:=Or[Length[sys]==0,Union@@sys==Range[Max@@Max@@sys]];
Select[Range[1000],And[SquareFreeQ[#],normQ[primeMS/@primeMS[#]],And@@(PrimeQ[#]||(SquareFreeQ[#]&&PrimeOmega[#]==2)&/@primeMS[#])]&]

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.

A340105 Odd products of distinct primes of nonprime index (A007821).

Original entry on oeis.org

1, 7, 13, 19, 23, 29, 37, 43, 47, 53, 61, 71, 73, 79, 89, 91, 97, 101, 103, 107, 113, 131, 133, 137, 139, 149, 151, 161, 163, 167, 173, 181, 193, 197, 199, 203, 223, 227, 229, 233, 239, 247, 251, 257, 259, 263, 269, 271, 281, 293, 299, 301, 307, 311, 313, 317

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 sets of multisets begins:
     1: {}              91: {{1,1},{1,2}}      173: {{1,1,1,3}}
     7: {{1,1}}         97: {{3,3}}            181: {{1,2,4}}
    13: {{1,2}}        101: {{1,6}}            193: {{1,1,5}}
    19: {{1,1,1}}      103: {{2,2,2}}          197: {{2,2,3}}
    23: {{2,2}}        107: {{1,1,4}}          199: {{1,9}}
    29: {{1,3}}        113: {{1,2,3}}          203: {{1,1},{1,3}}
    37: {{1,1,2}}      131: {{1,1,1,1,1}}      223: {{1,1,1,1,2}}
    43: {{1,4}}        133: {{1,1},{1,1,1}}    227: {{4,4}}
    47: {{2,3}}        137: {{2,5}}            229: {{1,3,3}}
    53: {{1,1,1,1}}    139: {{1,7}}            233: {{2,7}}
    61: {{1,2,2}}      149: {{3,4}}            239: {{1,1,6}}
    71: {{1,1,3}}      151: {{1,1,2,2}}        247: {{1,2},{1,1,1}}
    73: {{2,4}}        161: {{1,1},{2,2}}      251: {{1,2,2,2}}
    79: {{1,5}}        163: {{1,8}}            257: {{3,5}}
    89: {{1,1,1,2}}    167: {{2,6}}            259: {{1,1},{1,1,2}}

These primes (of nonprime index) are listed by A007821.
The non-strict version is A320629, with not necessarily odd version A320628.
The not necessarily odd version is A340104.
The prime instead of odd nonprime version:
  primes: A006450
  products: A076610
  strict: A302590
The squarefree semiprime instead of odd nonprime version:
  strict: A309356
  primes: A322551
  products: A339113
The semiprime instead of odd nonprime version:
  primes: A106349
  products: A339112
  strict: A340020
A001358 lists semiprimes.
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.
A330944 counts nonprime prime indices.
A330945 lists numbers with a nonprime prime index (nonprime case: A330948).
A339561 lists products of distinct squarefree semiprimes.
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, A320911, A320912.

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

Equals A005117 /\ A005408 /\ A320628 = A005117 /\ A320629.

A370165 Number of labeled loop-graphs covering n vertices without a non-loop edge with loops at both ends.

Original entry on oeis.org

1, 1, 4, 29, 400, 10289, 496548, 45455677, 7983420736, 2716094133313, 1803251169342820, 2348787270663723581, 6024912118926389490448, 30516957491540079828757553, 305811332460677494410532494660, 6071677788061208810793717466942237

Offset: 0

Gus Wiseman, Feb 12 2024

nonn

Number of ways to choose a stable vertex set of a simple graph with n vertices.

			The a(3) = 29 loop-graphs (loops shown as singletons):
  {1,23}   {1,2,3}     {1,2,13,23}
  {2,13}   {1,2,13}    {1,3,12,23}
  {3,12}   {1,2,23}    {2,3,12,13}
  {12,13}  {1,3,12}    {1,12,13,23}
  {12,23}  {1,3,23}    {2,12,13,23}
  {13,23}  {2,3,12}    {3,12,13,23}
           {2,3,13}
           {1,12,13}
           {1,12,23}
           {1,13,23}
           {2,12,13}
           {2,12,23}
           {2,13,23}
           {3,12,13}
           {3,12,23}
           {3,13,23}
           {12,13,23}

Andrew Howroyd, Table of n, a(n) for n = 0..80

Without loops we have A006129, connected A001187.
The non-covering version is A079491.
The unlabeled version is A370166, non-covering A339832.
A000085, A100861, A111924 count set partitions into singletons or pairs.
A000666 counts unlabeled loop-graphs, covering A322700.
A006125 counts labeled loop-graphs (shifted left), covering A322661.
Cf. A048291, A062740, A116539, A320461, A322635.

Table[Length[Select[Subsets[Subsets[Range[n],{1,2}]], Union@@#==Range[n]&&!MatchQ[#, {_,{x_},_,{y_},_,{x_,y_},_}]&]],{n,0,5}]

seq(n)={Vec(serlaplace(sum(k=0, n, exp((2^k-1)*x + O(x*x^n))*2^(k*(k-1)/2)*x^k/k!)))} \\ Andrew Howroyd, Feb 20 2024

Inverse binomial transform of A079491.

E.g.f.: Sum_{k >= 0} exp((2^k-1)*x)*2^(k*(k-1)/2)*x^k/k!. - Andrew Howroyd, Feb 20 2024

cp's OEIS Frontend

A340018 MM-numbers of labeled graphs with half-loops covering an initial interval of positive integers, without isolated vertices.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A340105 Odd products of distinct primes of nonprime index (A007821).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A370165 Number of labeled loop-graphs covering n vertices without a non-loop edge with loops at both ends.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula