OFFSET
1,2
LINKS
Dario Ch, Table of n, a(n) for n = 1..10000
PROG
(Python)
from heapq import heappush, heappop
def sequence():
pq = [1]
seen = set(pq)
while True:
value = heappop(pq)
yield value
seen.remove(value)
for x in 2 * value, 12 * value:
if x not in seen:
heappush(pq, x)
seen.add(x)
seq = sequence()
finalsequence_list = [next(seq) for i in range(100)] # Dario Ch, Sep 01 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Dario Ch, Sep 01 2018
STATUS
approved