A079254 -id:A079254 - cp's OEIS frontend

A322385 2 and prime numbers whose prime index is a product of at least two not necessarily distinct prime numbers already in the sequence.

2, 7, 19, 43, 53, 107, 131, 163, 227, 263, 311, 383, 443, 521, 577, 613, 719, 751, 881, 1021, 1193, 1301, 1307, 1423, 1619, 1667, 1699, 1993, 2003, 2161, 2309, 2311, 2437, 2539, 2693, 2939, 2969, 3167, 3209, 3671, 3767, 3779, 3833, 4423, 4481, 4597, 4871, 5147

Offset: 1

Gus Wiseman, Dec 05 2018

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.

			We have 1993 = prime(301) = prime(7 * 43). Since 7 and 43 already belong to the sequence, so does 1993.

Alois P. Heinz, Table of n, a(n) for n = 1..1000

Cf. A000002, A001462, A007097, A079000, A079254, A277098, A280996, A291636, A304360, A320628, A322386.

ppQ[n_]:=And[PrimeQ[n],!PrimeQ[PrimePi[n]],And@@ppQ/@First/@If[n==2,{},FactorInteger[PrimePi[n]]]];
Select[Range[1000],ppQ]

A322386 Numbers whose prime indices are not prime and already belong to the sequence.

Original entry on oeis.org

1, 2, 4, 7, 8, 14, 16, 19, 28, 32, 38, 43, 49, 53, 56, 64, 76, 86, 98, 106, 107, 112, 128, 131, 133, 152, 163, 172, 196, 212, 214, 224, 227, 256, 262, 263, 266, 301, 304, 311, 326, 343, 344, 361, 371, 383, 392, 424, 428, 443, 448, 454, 512, 521, 524, 526, 532

Offset: 1

Gus Wiseman, Dec 05 2018

nonn

Union of A291636 (Matula-Goebel numbers of series-reduced rooted trees) and A322385.
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 multiplicative semigroup: if x and y are in the sequence, then so is x*y. - Robert Israel, Dec 06 2018

			1 has no prime indices, so the definition is satisfied vacuously. - _Robert Israel_, Dec 07 2018
We have 301 = prime(4) * prime(14). Since 4 and 14 already belong to the sequence, so does 301.

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

Cf. A000002, A001462, A007097, A079000, A079254, A214577, A276625, A291636, A304360, A320628, A322385.

Res:= 1: S:= {1}:
for n from 2 to 1000 do
  F:= map(numtheory:-pi, numtheory:-factorset(n));
  if F subset S then
    Res:= Res, n;
    if not isprime(n) then S:= S union {n} fi
fi
od:
Res; # Robert Israel, Dec 06 2018

tnpQ[n_]:=With[{m=PrimePi/@First/@If[n==1,{},FactorInteger[n]]},And[!MemberQ[m,_?PrimeQ],And@@tnpQ/@m]]
Select[Range[1000],tnpQ]

A324855 Lexicographically earliest sequence containing 2 and all squarefree numbers > 2 whose prime indices already belong to the sequence.

Original entry on oeis.org

2, 3, 5, 11, 15, 31, 33, 47, 55, 93, 127, 137, 141, 155, 165, 211, 235, 257, 341, 381, 411, 465, 487, 517, 633, 635, 685, 705, 709, 771, 773, 811, 907, 977, 1023, 1055, 1285, 1297, 1397, 1457, 1461, 1483, 1507, 1551, 1621, 1705, 1905, 2055, 2127, 2293, 2319

Offset: 1

Gus Wiseman, Mar 18 2019

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:
    2: {1}
    3: {2}
    5: {3}
   11: {5}
   15: {2,3}
   31: {11}
   33: {2,5}
   47: {15}
   55: {3,5}
   93: {2,11}
  127: {31}
  137: {33}
  141: {2,15}
  155: {3,11}
  165: {2,3,5}
  211: {47}
  235: {3,15}
  257: {55}
  341: {5,11}
  381: {2,31}

Robert Israel, Table of n, a(n) for n = 1..1567
Gus Wiseman, The rooted identity trees whose Matula-Goebel numbers are the first 64 terms.

Cf. A000002, A000720, A001462, A079254, A109298, A112798, A276625, A290822.
Cf. A324697, A324698, A324736, A324748, A324753, A324843, A324850, A324854.
Contains A007097 except for 1.

S:= {2}: count:= 1:
for n from 3 by 2 while count < 100 do
  F:= ifactors(n)[2];
  if max(map(t -> t[2],F))=1 and {seq(numtheory:-pi(t[1]),t=F)} subset S then
     S:= S union {n}; count:= count+1;
  fi
od:
sort(convert(S,list)); # Robert Israel, Mar 22 2019

aQ[n_]:=Switch[n,1,False,2,True,?(!SquareFreeQ[#]&),False,,And@@Cases[FactorInteger[n],{p_,k_}:>aQ[PrimePi[p]]]];
Select[Range[1000],aQ]

A334067 a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a term of the sequence if and only if a(n) is prime" where indices start from 0.

Original entry on oeis.org

1, 2, 3, 5, 6, 7, 11, 13, 14, 15, 16, 17, 18, 19, 23, 29, 31, 37, 41, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 59, 60, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 132, 133, 134, 135, 137, 139, 140, 149

Offset: 0

Adnan Baysal, Apr 13 2020

nonn

a(n) is the minimal sequence for which the sequence generated by the indices of primes in this sequence is equal to itself, where indices start from 0.
So if f is a function on 0-indexed integer sequences with infinitely many primes where f returns the increasing sequence of indices of primes of the input sequence b(n), then a(n) is the lexicographically minimal fixed point of f.
a(n) has almost the same definition as A079254, except that a(n) starts indices from 0 instead of 1. But the resulting sequences do not seem to have any correlation.

			a(0) cannot be 0, since then 0 should be prime, which it is not.
a(0) = 1 is valid hence a(1) must be the next prime, which is a(1) = 2.
Then a(2) should be the next prime, hence a(2) = 3.
a(3) should be prime, hence a(3) = 5.
Since 4 is not in the sequence so far, a(4) must be the next nonprime, which means a(4) = 6.

The same definition as A079254 except here the indices start from 0 instead of 1.

Cf. A079000, A079313.

# is_prime(n) is a Python function which returns True if n is prime, and returns False otherwise. In the form stated below runs with SageMath.
def a_list(length):
    """Returns the list [a(0), ..., a(length-1)]."""
    num = 1
    b = [1]
    for i in range(1, length):
        num += 1
        if i in b:
            while not is_prime(num):
                num += 1
            b.append(num)
        else:
            while is_prime(num):
                num += 1
            b.append(num)
    return b
print(a_list(63))

A306719 Lexicographically earliest sequence containing 2 and all positive integers n such that the prime indices of n - 1 already belong to the sequence.

Original entry on oeis.org

2, 4, 8, 10, 20, 22, 28, 30, 50, 58, 64, 72, 80, 82, 88, 108, 114, 134, 148, 172, 190, 204, 214, 230, 238, 244, 262, 272, 312, 322, 340, 344, 360, 362, 400, 410, 422, 442, 458, 498, 514, 552, 554, 568, 594, 610, 620, 640, 688, 712, 730, 750, 758, 784, 792, 814

Offset: 1

Gus Wiseman, Mar 11 2019

nonn

A self-describing sequence, similar to A304360.

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.

Prime indices of A324699.
Cf. A000002, A000720, A001222, A001462, A007097, A055396, A061395, A079000, A079254, A109298, A112798, A276625, A277098, A304360.
Cf. A324694, A324695, A324696, A324697, A324698, A324700, A324701, A324702, A324703, A324704, A324705.

aQ[n_]:=Switch[n,0,False,2,True,,And@@Cases[FactorInteger[n-1],{p,k_}:>aQ[PrimePi[p]]]];
Select[Range[0,100],aQ]

a(n) = A324699(n) + 1.

A242940 a(n) is the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a term of the sequence if and only if a(n) is a Fibonacci number".

Original entry on oeis.org

1, 2, 3, 6, 7, 8, 13, 21, 22, 23, 24, 25, 34, 35, 36, 37, 38, 39, 40, 41, 55, 89, 144, 233, 377, 378, 379, 380, 381, 382, 383, 384, 610, 987, 1597

Offset: 1

J. Lowell, Jun 12 2014

			a(4) cannot be 5 because that would require 4 to be a term of this sequence.

Cf. A079000, A079253, A079254, A079258, A079256, A079257.

cp's OEIS Frontend

A322385 2 and prime numbers whose prime index is a product of at least two not necessarily distinct prime numbers already in the sequence.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A322386 Numbers whose prime indices are not prime and already belong to the sequence.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A324855 Lexicographically earliest sequence containing 2 and all squarefree numbers > 2 whose prime indices already belong to the sequence.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A334067 a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a term of the sequence if and only if a(n) is prime" where indices start from 0.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Python

A306719 Lexicographically earliest sequence containing 2 and all positive integers n such that the prime indices of n - 1 already belong to the sequence.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

Formula

A242940 a(n) is the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a term of the sequence if and only if a(n) is a Fibonacci number".

Views

Author

Keywords

Examples

Crossrefs