OFFSET
1,2
COMMENTS
The order is self-explanatory (or see the Kubo-Vakil paper).
Of course once we reach subsets containing 10 this way of representing subsets by concatenation is unsatisfactory. Still, the sequence serves as a pointer to the Kubo-Vakil paper.
Sort by largest element, then decreasing size, then lexicographically (see Kubo-Vakil paper). - Michael S. Branicky, Jan 12 2021
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..10000
T. Kubo and R. Vakil, On Conway's recursive sequence, Discr. Math. 152 (1996), 225-252. a(n) is the concatenation of their S(n).
PROG
(Python)
from itertools import chain, combinations as C
def powerset(s): # in decreasing size
return chain.from_iterable(C(s, r) for r in range(len(s), -1, -1))
def agen():
m = 1 # largest element
while True:
for p in powerset(range(1, m)): yield int("".join(map(str, p+(m, ))))
m += 1
def aupton(terms):
alst, g = [], agen()
while len(alst) < terms: alst += [next(g)]
return alst
print(aupton(63)) # Michael S. Branicky, Jan 12 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jun 03 2012
EXTENSIONS
a(25) corrected by Michael S. Branicky, Jan 12 2021
STATUS
approved