This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A377925 #13 Dec 15 2024 04:40:08 %S A377925 0,11,100,101,103,110,114,120,201,210,1000,1003,1007,1008,1020,1029, %T A377925 1030,1040,1047,1048,1082,1208,1280,1802,1820,2018,2081,2108,2180, %U A377925 2801,2810,8012,8021,8102,8120,8201,8210,10002,10004,10007,10020,10060,10080,10081,10100,10105,10113,10304,10502,10520,11125,11152,11215,11251,11512,11521,12005,12050,12115,12151 %N A377925 Records in A228407. %C A377925 First 48 terms were computed by _Robert G. Wilson v_, Dec 31 2013: see Comments in A228407. %H A377925 Chai Wah Wu, <a href="/A377925/b377925.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..514 from N. J. A. Sloane) %o A377925 (Python) %o A377925 from itertools import islice %o A377925 from collections import Counter %o A377925 def A377925_gen(): # generator of terms %o A377925 yield from (0,11) %o A377925 l, s, b, c = Counter('11'), 1, {11}, 11 %o A377925 while True: %o A377925 i = s %o A377925 while True: %o A377925 if i not in b: %o A377925 li, o = Counter(str(i)), 0 %o A377925 for d in (l+li).values(): %o A377925 if d % 2: %o A377925 if o > 0: %o A377925 break %o A377925 o += 1 %o A377925 else: %o A377925 if i>c: %o A377925 yield (c:=i) %o A377925 l = li %o A377925 b.add(i) %o A377925 while s in b: %o A377925 b.remove(s) %o A377925 s += 1 %o A377925 break %o A377925 i += 1 %o A377925 A377925_list = list(islice(A377925_gen(),40)) # _Chai Wah Wu_, Dec 14 2024 %Y A377925 Cf. A228407, A229218, A377926. %K A377925 nonn,base %O A377925 1,2 %A A377925 _N. J. A. Sloane_, Dec 14 2024