|
%I #8 Aug 19 2022 13:52:28
%S 1,2,5,8,9,10,11,12,15,18,19,20,21,22,25,28,29,50,51,52,55,58,59,80,
%T 81,82,85,88,89,90,91,92,95,98,99,1000000,1000001,1000002,1000005,
%U 1000008,1000009,1000010,1000011,1000012,1000015,1000018,1000019,1000020
%N Suburban numbers: without b, r, s or u.
%D M. J. Halm, Sequences (Re)discovered, Mpossibilities 81 (Aug. 2002).
%H Michael S. Branicky, <a href="/A072955/b072955.txt">Table of n, a(n) for n = 1..10000</a>
%H Michael Halm, <a href="http://michaelhalm.tripod.com/id109.htm">Sequences (Re)discovered</a>.
%o (Python)
%o from num2words import num2words
%o from itertools import islice, product
%o def ok(n): return set(num2words(n)) & {"b", "r", "s", "u"} == set()
%o def agen(): # generator of terms < 10**304
%o base, pows = [k for k in range(1, 1000) if ok(k)], [1]
%o yield from ([0] if ok(0) else []) + base
%o for e in range(3, 304, 3):
%o if set(num2words(10**e)[4:]) & {"b", "r", "s", "u"} == set():
%o pows = [10**e] + pows
%o for t in product([0] + base, repeat=len(pows)):
%o if t[0] == 0: continue
%o yield sum(t[i]*pows[i] for i in range(len(t)))
%o print(list(islice(agen(), 66))) # _Michael S. Branicky_, Aug 19 2022
%Y Cf. A089590, A072956, A072957.
%K easy,nonn,word
%O 1,2
%A _Michael Joseph Halm_, Aug 13 2002
|
