A331784 -id:A331784 - cp's OEIS frontend

A331915 Numbers with exactly one prime prime index, counted with multiplicity.

3, 5, 6, 10, 11, 12, 17, 20, 21, 22, 24, 31, 34, 35, 39, 40, 41, 42, 44, 48, 57, 59, 62, 65, 67, 68, 69, 70, 77, 78, 80, 82, 83, 84, 87, 88, 95, 96, 109, 111, 114, 115, 118, 119, 124, 127, 129, 130, 134, 136, 138, 140, 141, 143, 145, 147, 154, 156, 157, 159

Offset: 1

Gus Wiseman, Feb 08 2020

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 their prime indices begins:
    3: {2}             57: {2,8}            114: {1,2,8}
    5: {3}             59: {17}             115: {3,9}
    6: {1,2}           62: {1,11}           118: {1,17}
   10: {1,3}           65: {3,6}            119: {4,7}
   11: {5}             67: {19}             124: {1,1,11}
   12: {1,1,2}         68: {1,1,7}          127: {31}
   17: {7}             69: {2,9}            129: {2,14}
   20: {1,1,3}         70: {1,3,4}          130: {1,3,6}
   21: {2,4}           77: {4,5}            134: {1,19}
   22: {1,5}           78: {1,2,6}          136: {1,1,1,7}
   24: {1,1,1,2}       80: {1,1,1,1,3}      138: {1,2,9}
   31: {11}            82: {1,13}           140: {1,1,3,4}
   34: {1,7}           83: {23}             141: {2,15}
   35: {3,4}           84: {1,1,2,4}        143: {5,6}
   39: {2,6}           87: {2,10}           145: {3,10}
   40: {1,1,1,3}       88: {1,1,1,5}        147: {2,4,4}
   41: {13}            95: {3,8}            154: {1,4,5}
   42: {1,2,4}         96: {1,1,1,1,1,2}    156: {1,1,2,6}
   44: {1,1,5}        109: {29}             157: {37}
   48: {1,1,1,1,2}    111: {2,12}           159: {2,16}

These are numbers n such that A257994(n) = 1.
Prime-indexed primes are A006450, with products A076610.
The number of distinct prime prime indices is A279952.
Numbers with at least one prime prime index are A331386.
The set S of numbers with exactly one prime index in S are A331785.
The set S of numbers with exactly one distinct prime index in S are A331913.
Numbers with at most one prime prime index are A331914.
Numbers with exactly one distinct prime prime index are A331916.
Numbers with at most one distinct prime prime index are A331995.
Cf. A000040, A000720, A007097, A007821, A018252, A112798, A289509, A320628, A330944, A330945, A331784.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],Count[primeMS[#],_?PrimeQ]==1&]

A331912 Lexicographically earliest sequence of positive integers that have at most one distinct prime index already in the sequence.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23, 25, 26, 27, 29, 31, 32, 37, 39, 41, 43, 47, 49, 52, 53, 58, 59, 61, 64, 65, 67, 71, 73, 74, 79, 81, 83, 86, 87, 89, 91, 94, 97, 101, 103, 104, 107, 109, 111, 113, 116, 117, 121, 122, 125, 127, 128, 129, 131, 137

Offset: 1

Gus Wiseman, Feb 01 2020

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.

Conjecture: a(n)/A331784(n) -> 1 as n -> infinity.

			The sequence of terms together with their prime indices begins:
    1: {}              37: {12}              86: {1,14}
    2: {1}             39: {2,6}             87: {2,10}
    3: {2}             41: {13}              89: {24}
    4: {1,1}           43: {14}              91: {4,6}
    5: {3}             47: {15}              94: {1,15}
    7: {4}             49: {4,4}             97: {25}
    8: {1,1,1}         52: {1,1,6}          101: {26}
    9: {2,2}           53: {16}             103: {27}
   11: {5}             58: {1,10}           104: {1,1,1,6}
   13: {6}             59: {17}             107: {28}
   16: {1,1,1,1}       61: {18}             109: {29}
   17: {7}             64: {1,1,1,1,1,1}    111: {2,12}
   19: {8}             65: {3,6}            113: {30}
   23: {9}             67: {19}             116: {1,1,10}
   25: {3,3}           71: {20}             117: {2,2,6}
   26: {1,6}           73: {21}             121: {5,5}
   27: {2,2,2}         74: {1,12}           122: {1,18}
   29: {10}            79: {22}             125: {3,3,3}
   31: {11}            81: {2,2,2,2}        127: {31}
   32: {1,1,1,1,1}     83: {23}             128: {1,1,1,1,1,1,1}
For example, the prime indices of 117 are {2,2,6}, of which only 2 is already in the sequence, so 117 is in the sequence.

Gus Wiseman, Plot of A331912(n)/A331784(n) for n = 1..3729.

Contains all prime powers A000961.
Numbers S without all prime indices in S are A324694.
Numbers S without any prime indices in S are A324695.
Numbers S with at most one prime index in S are A331784.
Numbers S with exactly one prime index in S are A331785.
Numbers S with exactly one distinct prime index in S are A331913.
Cf. A000002, A000720, A001222, A001462, A324696, A331683, A331873, A331914.

aQ[n_]:=Length[Select[PrimePi/@First/@If[n==1,{},FactorInteger[n]],aQ]]<=1;
Select[Range[100],aQ]

A331936 Matula-Goebel numbers of semi-lone-child-avoiding rooted trees with at most one distinct non-leaf branch directly under any vertex (semi-achirality).

Original entry on oeis.org

1, 2, 4, 6, 8, 9, 12, 14, 16, 18, 24, 26, 27, 28, 32, 36, 38, 46, 48, 49, 52, 54, 56, 64, 72, 74, 76, 81, 86, 92, 96, 98, 104, 106, 108, 112, 122, 128, 144, 148, 152, 162, 169, 172, 178, 184, 192, 196, 202, 206, 208, 212, 214, 216, 224, 243, 244, 256, 262, 288

Offset: 1

Gus Wiseman, Feb 03 2020

nonn

First differs from A331873 in lacking 69, the Matula-Goebel number of the tree ((o)((o)(o))).
A rooted tree is semi-lone-child-avoiding if there are no vertices with exactly one child unless that child is an endpoint/leaf.
The Matula-Goebel number of a rooted tree is the product of primes indexed by the Matula-Goebel numbers of the branches of its root, which gives a bijective correspondence between positive integers and unlabeled rooted trees.
Consists of 1, 2, and all numbers equal to a power of 2 (other than 1) times a power of prime(j) for some j > 1 already in the sequence.

			The sequence of rooted trees ranked by this sequence together with their Matula-Goebel numbers begins:
   1: o
   2: (o)
   4: (oo)
   6: (o(o))
   8: (ooo)
   9: ((o)(o))
  12: (oo(o))
  14: (o(oo))
  16: (oooo)
  18: (o(o)(o))
  24: (ooo(o))
  26: (o(o(o)))
  27: ((o)(o)(o))
  28: (oo(oo))
  32: (ooooo)
  36: (oo(o)(o))
  38: (o(ooo))
  46: (o((o)(o)))
  48: (oooo(o))
  49: ((oo)(oo))
The sequence of terms together with their prime indices begins:
    1: {}              52: {1,1,6}            152: {1,1,1,8}
    2: {1}             54: {1,2,2,2}          162: {1,2,2,2,2}
    4: {1,1}           56: {1,1,1,4}          169: {6,6}
    6: {1,2}           64: {1,1,1,1,1,1}      172: {1,1,14}
    8: {1,1,1}         72: {1,1,1,2,2}        178: {1,24}
    9: {2,2}           74: {1,12}             184: {1,1,1,9}
   12: {1,1,2}         76: {1,1,8}            192: {1,1,1,1,1,1,2}
   14: {1,4}           81: {2,2,2,2}          196: {1,1,4,4}
   16: {1,1,1,1}       86: {1,14}             202: {1,26}
   18: {1,2,2}         92: {1,1,9}            206: {1,27}
   24: {1,1,1,2}       96: {1,1,1,1,1,2}      208: {1,1,1,1,6}
   26: {1,6}           98: {1,4,4}            212: {1,1,16}
   27: {2,2,2}        104: {1,1,1,6}          214: {1,28}
   28: {1,1,4}        106: {1,16}             216: {1,1,1,2,2,2}
   32: {1,1,1,1,1}    108: {1,1,2,2,2}        224: {1,1,1,1,1,4}
   36: {1,1,2,2}      112: {1,1,1,1,4}        243: {2,2,2,2,2}
   38: {1,8}          122: {1,18}             244: {1,1,18}
   46: {1,9}          128: {1,1,1,1,1,1,1}    256: {1,1,1,1,1,1,1,1}
   48: {1,1,1,1,2}    144: {1,1,1,1,2,2}      262: {1,32}
   49: {4,4}          148: {1,1,12}           288: {1,1,1,1,1,2,2}

David Callan, A sign-reversing involution to count labeled lone-child-avoiding trees, arXiv:1406.7784 [math.CO], (30-June-2014).
Gus Wiseman, Sequences counting series-reduced and lone-child-avoiding trees by number of vertices.

A superset of A000079.
The non-lone-child-avoiding version is A320230.
The non-semi version is A320269.
These trees are counted by A331933.
Not requiring semi-achirality gives A331935.
The fully-achiral case is A331992.
Achiral trees are counted by A003238.
Numbers with at most one distinct odd prime factor are A070776.
Matula-Goebel numbers of achiral rooted trees are A214577.
Matula-Goebel numbers of semi-identity trees are A306202.
Numbers S with at most one distinct prime index in S are A331912.
Cf. A001678, A007097, A050381, A061775, A196050, A291636, A331784, A331873, A331914, A331934, A331965, A331967, A331991.

msQ[n_]:=n<=2||!PrimeQ[n]&&Length[DeleteCases[FactorInteger[n],{2,_}]]<=1&&And@@msQ/@PrimePi/@First/@FactorInteger[n];
Select[Range[100],msQ]

Intersection of A320230 and A331935.

A331681 One, two, and all numbers of the form 2^k * prime(j) where k > 0 and j already belongs to the sequence.

Original entry on oeis.org

1, 2, 4, 6, 8, 12, 14, 16, 24, 26, 28, 32, 38, 48, 52, 56, 64, 74, 76, 86, 96, 104, 106, 112, 128, 148, 152, 172, 178, 192, 202, 208, 212, 214, 224, 256, 262, 296, 304, 326, 344, 356, 384, 404, 416, 424, 428, 446, 448, 478, 512, 524, 526, 592, 608, 622, 652

Offset: 1

Gus Wiseman, Jan 26 2020

nonn

Also Matula-Goebel numbers of semi-lone-child-avoiding locally disjoint rooted semi-identity trees. A rooted tree is semi-lone-child-avoiding if there are no vertices with exactly one child unless the child is an endpoint/leaf. Locally disjoint means no branch of any vertex overlaps a different (unequal) branch of the same vertex. In a semi-identity tree, all non-leaf branches of any given vertex are distinct. Note that these conditions together imply that there is at most one non-leaf branch under any given vertex.
Also Matula-Goebel numbers of semi-lone-child-avoiding rooted trees with at most one non-leaf branch under any given vertex.
The Matula-Goebel number of a rooted tree is the product of primes indexed by the Matula-Goebel numbers of its branches (of the root), which gives a bijective correspondence between positive integers and unlabeled rooted trees.

			The sequence of all semi-lone-child-avoiding rooted trees with at most one non-leaf branch under any given vertex, together with their Matula-Goebel numbers, begins:
   1: o
   2: (o)
   4: (oo)
   6: (o(o))
   8: (ooo)
  12: (oo(o))
  14: (o(oo))
  16: (oooo)
  24: (ooo(o))
  26: (o(o(o)))
  28: (oo(oo))
  32: (ooooo)
  38: (o(ooo))
  48: (oooo(o))
  52: (oo(o(o)))
  56: (ooo(oo))
  64: (oooooo)
  74: (o(oo(o)))
  76: (oo(ooo))
  86: (o(o(oo)))

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

The enumeration of these trees by nodes is A324969 (essentially A000045).
The enumeration of these trees by leaves appears to be A090129(n + 1).
The (non-semi) lone-child-avoiding version is A331683.
Matula-Goebel numbers of rooted semi-identity trees are A306202.
Lone-child-avoiding locally disjoint rooted trees by leaves are A316697.
The set S of numbers with at most one prime index in S is A331784.
Matula-Goebel numbers of locally disjoint rooted trees are A316495.
Cf. A000081, A000669, A001678, A007097, A061775, A196050, A291636, A316470, A316473, A331679, A331680, A331682, A331687, A331783, A331785, A331873.

N:= 1000: # for terms <= N
S:= {1,2}:
with(queue):
Q:= new(1,2):
while not empty(Q) do
  r:= dequeue(Q);
  p:= ithprime(r);
  newS:= {seq(2^i*p,i=1..ilog2(N/p))} minus S;
  S:= S union newS;
  for s in newS do enqueue(Q,s) od:
od:
sort(convert(S,list)); # Robert Israel, Feb 05 2020

uryQ[n_]:=n==1||MatchQ[FactorInteger[n],({{2,},{p,1}}/;uryQ[PrimePi[p]])|{{2,_}}];
Select[Range[100],uryQ]

Intersection of A306202 (semi-identity), A316495 (locally disjoint), and A331935 (semi-lone-child-avoiding). - Gus Wiseman, Jun 09 2020

A331933 Number of semi-lone-child-avoiding rooted trees with at most one distinct non-leaf branch directly under any vertex.

Original entry on oeis.org

1, 1, 1, 2, 4, 6, 12, 18, 33, 52, 90, 142, 242, 384, 639, 1028, 1688, 2716, 4445, 7161, 11665, 18839, 30595, 49434, 80199, 129637, 210079, 339750, 550228, 889978, 1440909, 2330887, 3772845, 6103823, 9878357, 15982196, 25863454, 41845650, 67713550, 109559443

Offset: 1

Gus Wiseman, Feb 03 2020

nonn

A rooted tree is semi-lone-child-avoiding if there are no vertices with exactly one child unless the child is an endpoint/leaf.

			The a(1) = 1 through a(8) = 18 trees:
  o  (o)  (oo)  (ooo)   (oooo)    (ooooo)    (oooooo)
                (o(o))  (o(oo))   (o(ooo))   (o(oooo))
                        (oo(o))   (oo(oo))   (oo(ooo))
                        ((o)(o))  (ooo(o))   (ooo(oo))
                                  (o(o)(o))  (oooo(o))
                                  (o(o(o)))  ((oo)(oo))
                                             (o(o(oo)))
                                             (o(oo(o)))
                                             (oo(o)(o))
                                             (oo(o(o)))
                                             ((o)(o)(o))
                                             (o((o)(o)))

Andrew Howroyd, Table of n, a(n) for n = 1..1000
David Callan, A sign-reversing involution to count labeled lone-child-avoiding trees, arXiv:1406.7784 [math.CO], (30-June-2014).
Gus Wiseman, Sequences counting series-reduced and lone-child-avoiding trees by number of vertices.
Gus Wiseman, The a(11) = 90 semi-lone-child-avoiding rooted trees with at most one distinct non-leaf branch directly under any vertex.

Not requiring lone-child-avoidance gives A320222.
The non-semi version is A320268.
Matula-Goebel numbers of these trees are A331936.
Achiral trees are A003238.
Semi-identity trees are A306200.
Numbers S with at most one distinct prime index in S are A331912.
Semi-lone-child-avoiding rooted trees are A331934.
Cf. A000081, A001678, A004111, A050381, A214577, A291636, A320230, A320269, A331784, A331872, A331914, A331935, A331966.

sseo[n_]:=Switch[n,1,{{}},2,{{{}}},_,Join@@Function[c,Select[Union[Sort/@Tuples[sseo/@c]],Length[Union[DeleteCases[#,{}]]]<=1&]]/@Rest[IntegerPartitions[n-1]]];
Table[Length[sseo[n]],{n,10}]

seq(n)={my(v=vector(n)); for(n=1, n, v[n] = 1 + sum(i=2, n-2, ((n-1)\i)*v[i])); v} \\ Andrew Howroyd, Feb 09 2020

a(n) = 1 + Sum_{i=2..n-2} floor((n-1)/i)*a(i). - Andrew Howroyd, Feb 09 2020

Terms a(31) and beyond from Andrew Howroyd, Feb 09 2020

A331785 Lexicographically earliest sequence containing 1 and all positive integers with exactly one prime index already in the sequence, counting multiplicity.

Original entry on oeis.org

1, 2, 3, 5, 11, 14, 21, 26, 31, 34, 35, 38, 39, 43, 46, 51, 57, 58, 65, 69, 73, 74, 77, 82, 85, 87, 94, 95, 98, 101, 106, 111, 115, 118, 122, 123, 127, 134, 139, 141, 142, 143, 145, 147, 149, 158, 159, 163, 166, 167, 177, 178, 182, 183, 185, 187, 191, 194, 199

Offset: 1

Gus Wiseman, Feb 01 2020

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 their prime indices begins:
    1: {}         73: {21}       142: {1,20}     205: {3,13}
    2: {1}        74: {1,12}     143: {5,6}      206: {1,27}
    3: {2}        77: {4,5}      145: {3,10}     209: {5,8}
    5: {3}        82: {1,13}     147: {2,4,4}    213: {2,20}
   11: {5}        85: {3,7}      149: {35}       214: {1,28}
   14: {1,4}      87: {2,10}     158: {1,22}     217: {4,11}
   21: {2,4}      94: {1,15}     159: {2,16}     218: {1,29}
   26: {1,6}      95: {3,8}      163: {38}       226: {1,30}
   31: {11}       98: {1,4,4}    166: {1,23}     233: {51}
   34: {1,7}     101: {26}       167: {39}       235: {3,15}
   35: {3,4}     106: {1,16}     177: {2,17}     237: {2,22}
   38: {1,8}     111: {2,12}     178: {1,24}     238: {1,4,7}
   39: {2,6}     115: {3,9}      182: {1,4,6}    245: {3,4,4}
   43: {14}      118: {1,17}     183: {2,18}     249: {2,23}
   46: {1,9}     122: {1,18}     185: {3,12}     253: {5,9}
   51: {2,7}     123: {2,13}     187: {5,7}      262: {1,32}
   57: {2,8}     127: {31}       191: {43}       265: {3,16}
   58: {1,10}    134: {1,19}     194: {1,25}     266: {1,4,8}
   65: {3,6}     139: {34}       199: {46}       267: {2,24}
   69: {2,9}     141: {2,15}     201: {2,19}     269: {57}
For example, the prime indices of 77 are {4,5}, of which only 5 is in the sequence, so 77 is in the sequence.

Closed under A000040.
Numbers S without all prime indices in S are A324694.
Numbers S without any prime indices in S are A324695.
Numbers S with at most one prime index in S are A331784.
Numbers S with at most one distinct prime index in S are A331912.
Numbers S with exactly one distinct prime index in S are A331913.
Cf. A000002, A000720, A001222, A001462, A324696, A331683, A331873, A331915, A331916.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
aQ[n_]:=n==1||Length[Select[primeMS[n],aQ]]==1;
Select[Range[100],aQ]

A331914 Numbers with at most one prime prime index, counted with multiplicity.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 16, 17, 19, 20, 21, 22, 23, 24, 26, 28, 29, 31, 32, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 46, 47, 48, 49, 52, 53, 56, 57, 58, 59, 61, 62, 64, 65, 67, 68, 69, 70, 71, 73, 74, 76, 77, 78, 79, 80, 82, 83, 84, 86, 87

Offset: 1

Gus Wiseman, Feb 08 2020

nonn

First differs from A324935 in having 39.

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 their prime indices begins:
   1: {}           24: {1,1,1,2}      52: {1,1,6}
   2: {1}          26: {1,6}          53: {16}
   3: {2}          28: {1,1,4}        56: {1,1,1,4}
   4: {1,1}        29: {10}           57: {2,8}
   5: {3}          31: {11}           58: {1,10}
   6: {1,2}        32: {1,1,1,1,1}    59: {17}
   7: {4}          34: {1,7}          61: {18}
   8: {1,1,1}      35: {3,4}          62: {1,11}
  10: {1,3}        37: {12}           64: {1,1,1,1,1,1}
  11: {5}          38: {1,8}          65: {3,6}
  12: {1,1,2}      39: {2,6}          67: {19}
  13: {6}          40: {1,1,1,3}      68: {1,1,7}
  14: {1,4}        41: {13}           69: {2,9}
  16: {1,1,1,1}    42: {1,2,4}        70: {1,3,4}
  17: {7}          43: {14}           71: {20}
  19: {8}          44: {1,1,5}        73: {21}
  20: {1,1,3}      46: {1,9}          74: {1,12}
  21: {2,4}        47: {15}           76: {1,1,8}
  22: {1,5}        48: {1,1,1,1,2}    77: {4,5}
  23: {9}          49: {4,4}          78: {1,2,6}

These are numbers n such that A257994(n) <= 1.
Prime-indexed primes are A006450, with products A076610.
The number of distinct prime prime indices is A279952.
Numbers with at least one prime prime index are A331386.
The set S of numbers with at most one prime index in S are A331784.
The set S of numbers with at most one distinct prime index in S are A331912.
Numbers with exactly one prime prime index are A331915.
Numbers with exactly one distinct prime prime index are A331916.
Numbers with at most one distinct prime prime index are A331995.
Cf. A000040, A000720, A007097, A018252, A112798, A320628, A330945, A331785.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],Count[primeMS[#],_?PrimeQ]<=1&]

A331913 Lexicographically earliest sequence containing 1 and all positive integers that have exactly one distinct prime index already in the sequence.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 11, 16, 17, 19, 23, 25, 26, 27, 31, 32, 39, 49, 52, 53, 58, 59, 64, 65, 67, 74, 81, 82, 83, 86, 87, 91, 94, 97, 101, 103, 104, 111, 116, 117, 121, 122, 123, 125, 127, 128, 129, 131, 141, 142, 143, 145, 146, 148, 158, 164, 167, 172, 178

Offset: 1

Gus Wiseman, Feb 01 2020

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 their prime indices begins:
    1: {}              52: {1,1,6}          116: {1,1,10}
    2: {1}             53: {16}             117: {2,2,6}
    3: {2}             58: {1,10}           121: {5,5}
    4: {1,1}           59: {17}             122: {1,18}
    5: {3}             64: {1,1,1,1,1,1}    123: {2,13}
    7: {4}             65: {3,6}            125: {3,3,3}
    8: {1,1,1}         67: {19}             127: {31}
    9: {2,2}           74: {1,12}           128: {1,1,1,1,1,1,1}
   11: {5}             81: {2,2,2,2}        129: {2,14}
   16: {1,1,1,1}       82: {1,13}           131: {32}
   17: {7}             83: {23}             141: {2,15}
   19: {8}             86: {1,14}           142: {1,20}
   23: {9}             87: {2,10}           143: {5,6}
   25: {3,3}           91: {4,6}            145: {3,10}
   26: {1,6}           94: {1,15}           146: {1,21}
   27: {2,2,2}         97: {25}             148: {1,1,12}
   31: {11}           101: {26}             158: {1,22}
   32: {1,1,1,1,1}    103: {27}             164: {1,1,13}
   39: {2,6}          104: {1,1,1,6}        167: {39}
   49: {4,4}          111: {2,12}           172: {1,1,14}

Contains all prime powers A000961.
Numbers S without all prime indices in S are A324694.
Numbers S without any prime indices in S are A324695.
Numbers S with at most one prime index in S are A331784.
Numbers S with exactly one prime index in S are A331785.
Numbers S with at most one distinct prime index in S are A331912.
Cf. A000002, A000720, A001222, A001462, A324696, A331683, A331873, A331915, A331916.

aQ[n_]:=n==1||Length[Select[PrimePi/@First/@FactorInteger[n],aQ]]==1;
Select[Range[200],aQ]

A331916 Numbers with exactly one distinct prime prime index.

Original entry on oeis.org

3, 5, 6, 9, 10, 11, 12, 17, 18, 20, 21, 22, 24, 25, 27, 31, 34, 35, 36, 39, 40, 41, 42, 44, 48, 50, 54, 57, 59, 62, 63, 65, 67, 68, 69, 70, 72, 77, 78, 80, 81, 82, 83, 84, 87, 88, 95, 96, 100, 108, 109, 111, 114, 115, 117, 118, 119, 121, 124, 125, 126, 127

Offset: 1

Gus Wiseman, Feb 08 2020

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 their prime indices begins:
    3: {2}           40: {1,1,1,3}       81: {2,2,2,2}
    5: {3}           41: {13}            82: {1,13}
    6: {1,2}         42: {1,2,4}         83: {23}
    9: {2,2}         44: {1,1,5}         84: {1,1,2,4}
   10: {1,3}         48: {1,1,1,1,2}     87: {2,10}
   11: {5}           50: {1,3,3}         88: {1,1,1,5}
   12: {1,1,2}       54: {1,2,2,2}       95: {3,8}
   17: {7}           57: {2,8}           96: {1,1,1,1,1,2}
   18: {1,2,2}       59: {17}           100: {1,1,3,3}
   20: {1,1,3}       62: {1,11}         108: {1,1,2,2,2}
   21: {2,4}         63: {2,2,4}        109: {29}
   22: {1,5}         65: {3,6}          111: {2,12}
   24: {1,1,1,2}     67: {19}           114: {1,2,8}
   25: {3,3}         68: {1,1,7}        115: {3,9}
   27: {2,2,2}       69: {2,9}          117: {2,2,6}
   31: {11}          70: {1,3,4}        118: {1,17}
   34: {1,7}         72: {1,1,1,2,2}    119: {4,7}
   35: {3,4}         77: {4,5}          121: {5,5}
   36: {1,1,2,2}     78: {1,2,6}        124: {1,1,11}
   39: {2,6}         80: {1,1,1,1,3}    125: {3,3,3}

These are numbers n such that A279952(n) = 1.
Prime-indexed primes are A006450, with products A076610.
The number of prime prime indices is A257994.
Numbers with at least one prime prime index are A331386.
The set S of numbers with exactly one prime index in S are A331785.
The set S of numbers with exactly one distinct prime index in S are A331913.
Numbers with at most one prime prime index are A331914.
Numbers with at most one distinct prime prime index are A331995.
Cf. A000040, A000720, A007097, A007821, A018252, A112798, A289509, A320628, A330944, A330945, A331784.

Select[Range[100],Count[PrimePi/@First/@FactorInteger[#],_?PrimeQ]==1&]

A331995 Numbers with at most one distinct prime prime index.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 31, 32, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 46, 47, 48, 49, 50, 52, 53, 54, 56, 57, 58, 59, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 76

Offset: 1

Gus Wiseman, Feb 08 2020

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 their prime indices begins:
   1: {}           22: {1,5}          44: {1,1,5}
   2: {1}          23: {9}            46: {1,9}
   3: {2}          24: {1,1,1,2}      47: {15}
   4: {1,1}        25: {3,3}          48: {1,1,1,1,2}
   5: {3}          26: {1,6}          49: {4,4}
   6: {1,2}        27: {2,2,2}        50: {1,3,3}
   7: {4}          28: {1,1,4}        52: {1,1,6}
   8: {1,1,1}      29: {10}           53: {16}
   9: {2,2}        31: {11}           54: {1,2,2,2}
  10: {1,3}        32: {1,1,1,1,1}    56: {1,1,1,4}
  11: {5}          34: {1,7}          57: {2,8}
  12: {1,1,2}      35: {3,4}          58: {1,10}
  13: {6}          36: {1,1,2,2}      59: {17}
  14: {1,4}        37: {12}           61: {18}
  16: {1,1,1,1}    38: {1,8}          62: {1,11}
  17: {7}          39: {2,6}          63: {2,2,4}
  18: {1,2,2}      40: {1,1,1,3}      64: {1,1,1,1,1,1}
  19: {8}          41: {13}           65: {3,6}
  20: {1,1,3}      42: {1,2,4}        67: {19}
  21: {2,4}        43: {14}           68: {1,1,7}

These are numbers n such that A279952(n) <= 1.
Prime-indexed primes are A006450, with products A076610.
Numbers whose prime indices are not all prime are A330945.
Numbers with at least one prime prime index are A331386.
The set S of numbers with at most one prime index in S are A331784.
The set S of numbers with at most one distinct prime index in S are A331912.
Numbers with at most one prime prime index are A331914.
Numbers with exactly one prime prime index are A331915.
Numbers with exactly one distinct prime prime index are A331916.
Cf. A000040, A000720, A001221, A007097, A007821, A112798, A257994, A320628, A330944, A331785, A331912, A331913.

Select[Range[100],Count[PrimePi/@First/@FactorInteger[#],_?PrimeQ]<=1&]

cp's OEIS Frontend

A331915 Numbers with exactly one prime prime index, counted with multiplicity.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A331912 Lexicographically earliest sequence of positive integers that have at most one distinct prime index already in the sequence.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A331936 Matula-Goebel numbers of semi-lone-child-avoiding rooted trees with at most one distinct non-leaf branch directly under any vertex (semi-achirality).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A331681 One, two, and all numbers of the form 2^k * prime(j) where k > 0 and j already belongs to the sequence.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A331933 Number of semi-lone-child-avoiding rooted trees with at most one distinct non-leaf branch directly under any vertex.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A331785 Lexicographically earliest sequence containing 1 and all positive integers with exactly one prime index already in the sequence, counting multiplicity.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A331914 Numbers with at most one prime prime index, counted with multiplicity.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A331913 Lexicographically earliest sequence containing 1 and all positive integers that have exactly one distinct prime index already in the sequence.

Views

Author

Keywords

Comments

Examples