%I #17 Feb 26 2023 17:41:34

%S 0,1,2,6,12,44,92,184,1208,1256,4792,9912,19832,39664,563952,576464,

%T 4496112,4499184,17996528,17997488,143972080,145057520,145070832,

%U 294967024,589944560,1179889136,2359778272,71079255008,72019201952

%N Where records occur in A261461.

%C A261461(a(n)) = A261466(n).

%H Rémy Sigrist, <a href="/A261467/a261467_1.txt">C program</a>

%o (Haskell)

%o a261467 n = a261467_list !! (n-1)

%o -- where a261467_list is defined in A261466.

%o (C) See Links section.

%o (Python)

%o from itertools import count, islice

%o def f(n):

%o b, k = bin(n)[2:], 1

%o return next(k for k in count(1) if bin(k)[2:] not in b)

%o def agen(record=-1):

%o yield from (((record:=f(k)), k)[1] for k in count(0) if f(k) > record)

%o print(list(islice(agen(), 18))) # _Michael S. Branicky_, Feb 26 2023

%Y Cf. A261461, A261466.

%K nonn,more,base

%O 1,3

%A _Reinhard Zumkeller_, Aug 30 2015

%E Leading zero and more terms from _Rémy Sigrist_, Mar 10 2018

%E a(26)-a(29) from _Rémy Sigrist_, Feb 26 2023