OFFSET
1,2
COMMENTS
This is an intermediate sequence between the EKG sequence A064413 (which only involves the first condition) and the Enots Wolley sequence A336957 (which involves both conditions).
By ignoring the second condition when necessary we guarantee that a(n) always exists (because it always exists for the EKG sequence), and so no backtracking is needed in this sequence.
The second condition is ignored precisely when every prime that divides a(n-1) also divides a(n-2).
Conjecture 1: Every positive number appears.
Conjecture 2: The primes are the slowest numbers to appear. That is, when a prime p appears here, all numbers less than p have already appeared. To put this another way, the record high points in A352188 ("when does n appear") are exactly the primes (and 1).
Conjecture 3: When a prime p first divides some term, that term is 2*p, which is followed by p then 3p. [It seems possible that we could see 2*a, 6*b, 3*p, p, 2*p. This does not happen in the first 10000 terms, but I can't prove it never happens. I can prove that every prime divides some term, and that the primes appear in increasing order. Conjecture 3 might be refuted by a more extensive calculation.]
LINKS
N. J. A. Sloane, Table of n, a(n) for n = 1..20000
MAPLE
# To produce the first 1000 terms:
with(numtheory):
omega := proc(n) nops(numtheory[factorset](n)) end proc:
hit:=Array(1..100000, 0);
M:=100000;
a:=[1, 2]; K:=1; L:=2; hit[1]:=1; hit[2]:=2;
for n from 3 to 1000 do
sw1:=0;
# find a[n]
if factorset(L) subset factorset(K) then
# use EKG rule
for i from 1 to M do
if hit[i]=0 and igcd(i, L)>1 then a:=[op(a), i]; K:=L; L:=i; hit[i]:=n; sw1:=1; break; fi;
od:
if sw1=0 then error("failed EKG, n, i =", n, i); fi;
else
# use Enots Wolley rule
for i from 1 to M do
if hit[i]=0 and igcd(i, L)>1 and igcd(i, K)=1 then a:=[op(a), i]; K:=L; L:=i; hit[i]:=n; sw1:=1; break; fi;
od:
if sw1=0 then error("failed WOLLEY, n, i =", n, i); fi;
fi:
od:
a;
PROG
(Python)
from math import gcd
from itertools import count, islice
from sympy import primefactors
def A352187_gen(): # generator of terms
bset, blist, mmax = {1, 2}, [1, 2], 3
yield from blist
while True:
for m in count(mmax):
if gcd(m, blist[-1]) > 1 and m not in bset:
if all(blist[-2] % p == 0 for p in primefactors(blist[-1])) or gcd(m, blist[-2]) == 1:
yield m
blist = [blist[-1], m]
bset.add(m)
while mmax in bset:
mmax += 1
break
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Mar 12 2022
STATUS
approved