OFFSET
1,2
COMMENTS
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..7806
MATHEMATICA
s = {1}; k = 1; Do[If[GreaterEqual @@ (f = FactorInteger[n])[[;; , 2]] && PrimePi[f[[-1, 1]]] == Length[f], k++; If[Equal @@ IntegerExponent[n, {2, 3}], AppendTo[s, k]]], {n, 2, 10^5}]; s (* Amiram Eldar, Jul 28 2023 *)
PROG
(Python)
from itertools import count, islice
from heapq import heappop, heappush
from sympy import multiplicity, factorint, prevprime, nextprime
def A329897_gen(): # generator of terms
h, hset = [1], {1}
for c in count(1):
m = heappop(h)
if multiplicity(3, m)==(~m&m-1).bit_length():
yield c
ps = factorint(m)
for p in ps:
if p == 2 or ps[prevprime(p)]>ps[p]:
mp = m*p
if mp not in hset:
heappush(h, mp)
hset.add(mp)
mp = m*nextprime(max(ps.keys(), default=1))
if mp not in hset:
heappush(h, mp)
hset.add(mp)
KEYWORD
nonn
AUTHOR
Antti Karttunen, Dec 24 2019
STATUS
approved
