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 A261467 #17 Feb 26 2023 17:41:34 %S A261467 0,1,2,6,12,44,92,184,1208,1256,4792,9912,19832,39664,563952,576464, %T A261467 4496112,4499184,17996528,17997488,143972080,145057520,145070832, %U A261467 294967024,589944560,1179889136,2359778272,71079255008,72019201952 %N A261467 Where records occur in A261461. %C A261467 A261461(a(n)) = A261466(n). %H A261467 Rémy Sigrist, <a href="/A261467/a261467_1.txt">C program</a> %o A261467 (Haskell) %o A261467 a261467 n = a261467_list !! (n-1) %o A261467 -- where a261467_list is defined in A261466. %o A261467 (C) See Links section. %o A261467 (Python) %o A261467 from itertools import count, islice %o A261467 def f(n): %o A261467 b, k = bin(n)[2:], 1 %o A261467 return next(k for k in count(1) if bin(k)[2:] not in b) %o A261467 def agen(record=-1): %o A261467 yield from (((record:=f(k)), k)[1] for k in count(0) if f(k) > record) %o A261467 print(list(islice(agen(), 18))) # _Michael S. Branicky_, Feb 26 2023 %Y A261467 Cf. A261461, A261466. %K A261467 nonn,more,base %O A261467 1,3 %A A261467 _Reinhard Zumkeller_, Aug 30 2015 %E A261467 Leading zero and more terms from _Rémy Sigrist_, Mar 10 2018 %E A261467 a(26)-a(29) from _Rémy Sigrist_, Feb 26 2023