OFFSET
1,2
COMMENTS
Computed by Lars Blomberg.
Numbers a(n) = 0, 1, 11 (mod 100) cannot be added to this sequence, otherwise the sequence would terminate with 1, 2, 10, 3, 11. - Gleb Ivanov, Dec 06 2021
REFERENCES
Eric Angelini, Posting to Sequence Fans Mailing List, Sep 28 2013
LINKS
Eric Angelini, Less than <, Equal to =, Greater than > (see sequence Sg)
Eric Angelini, Less than <, Equal to =, Greater than > [Cached copy, with permission of the author]
PROG
(Python)
is_ok = lambda s: not any(s[i-2] <= s[i-1] <= s[i] for i in range(2, len(s)))
terms, appears, digits = [1], {1}, '1'
for i in range(100):
t = 1
while not(
t not in appears
and is_ok(digits + str(t))
and t % 100 not in [0, 1, 11]
): t += 1
terms.append(t); appears.add(t); digits = digits + str(t)
digits = digits[-2:]
print(terms) # Gleb Ivanov, Dec 06 2021
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Michel Marcus, Mar 11 2014
EXTENSIONS
a(56) corrected by Gleb Ivanov, Dec 17 2021
STATUS
approved