OFFSET
1,3
COMMENTS
Assumes 0 without a slash or a center dot, closed 4, 6, and 9, and no overlapping of multiple digits. Digits homologous to a (flattened) sphere: 1, 2, 3, 5, 7; to a torus: 0, 4, 6, 9; to a double torus: 8. Sequence is a run of the terms in ascending numeric order.
All topologically distinct terms can be represented by nondecreasing sequences of strings of 0s, 1s, and 8s. However, terms cannot begin with 0. Therefore, if a string has 0s, then (i) if there are any 1s, one of them moves to the front, (ii) else, the first 0 is replaced with 4. Sequence is the resulting strings sorted as base-10 numbers. - Michael S. Branicky, Jul 11 2024
EXAMPLE
0 is homologous to 1 torus, so a(1)=0.
1 is homologous to 1 sphere, so a(2)=1.
2 is homologous to 1 sphere, same as 1, so it is not in the sequence.
4 is homologous to 1 torus, same as 0, so it is not in the sequence.
8 is homologous to 1 double torus, so a(3)=8.
10 is homologous to 1 sphere and 1 torus, so a(4)=10.
11 is homologous to 2 spheres, so a(5)=11.
14 is homologous to 1 sphere and 1 torus, same as 10, so it is not in the sequence.
41 is homologous to 1 sphere and 1 torus, same as 10, so it is not in the sequence.
PROG
(PARI) df(d, c)=(10^c-1)/9*d
n=0; a=0; at=1; while(true, a++; at+=a+1; ac=0; for(b=0, a, for(c=0, b, n++; print(n, " ", if(n<=2, n-1, ac+b-c+1<at, 10^(a-1)+df(1, b)+df(7, c), ac+1<at, 4*10^(a-1)+df(8, c), df(8, a))); if(n==10000, break(3)); ac++)))
(Python)
from itertools import count, islice, combinations_with_replacement as cwr
def agen(): # generator of terms
after = {"1":"018", "4":"08", "8":"8"}
yield from (0, 1, 8)
for digits in count(2):
for first in "148":
for rest in cwr(after[first], digits-1):
yield int(first + "".join(rest))
print(list(islice(agen(), 50))) # Michael S. Branicky, Jul 07 2024
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Charles L. Hohn, Jul 05 2024
STATUS
approved