OFFSET
1,2
COMMENTS
The sequence can be constructed starting with term 1 and then:
At step number m >= 1, append terms k with gpfi(k) <= m and bigomega(k) <= m, and which have not already appeared, and ordered first by bigomega and then numerically.
Terms which have not appeared are exactly those with gpfi(k) = m or bigomega(k) = m, and in particular they start with prime(m) and end with prime(m)^m.
First differs from A344844 at n=30, with its ordering by prime exponents differing from here ordering numerically. - Michael S. Branicky, Apr 20 2025
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..12870 (all terms involving only primes <= 19, so ending with 19^8)
EXAMPLE
At step m=2, the new terms added are 3, 4, 6, 9, being those with gpfi(k) = 2, or with bigomega(k) = 2.
PROG
(Python)
from math import prod
from sympy import nextprime
from itertools import count, islice, combinations_with_replacement as cwr
def agen(): # generator of terms
aset, plst = set(), [1, 2]
for n in count(1):
row = []
for mc in cwr(plst, n):
p = prod(mc)
if p not in aset:
row.append((n-mc.count(1), p))
aset.add(p)
plst.append(nextprime(plst[-1]))
yield from (p for m, p in sorted(row))
print(list(islice(agen(), 80))) # Michael S. Branicky, Apr 18 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Bassam Abdul-Baki, Apr 18 2025
EXTENSIONS
a(33) and on corrected by Michael S. Branicky, Apr 19 2025
STATUS
approved
