Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #16 Jun 18 2023 11:42:48
%S 2,4,5,9,10,18,19,26,34,37,38,58,61,62,66,67,129,130,133,137,138,158,
%T 286,287,290,292,301,302,311,318,365,366,371,379,382,384,561,562,563,
%U 627,628,629,630,631,633,639,644,646,680,683,688,767,768,775,776,777,778,780,913,914,915,918,919,920,923,924,925,926,927,928,930,931,932,933,939,1315
%N Indices of "good matches" produced by match-making permutation A266195; numbers n for which A070939(A266195(n)) = A070939(A266195(n+1)), where A070939(n) gives the length of base-2 representation of n.
%C Numbers n for which A264982(n) = A264982(n+1).
%C It would be nice to know whether this sequence is infinite.
%H Rémy Sigrist, <a href="/A266197/b266197.txt">Table of n, a(n) for n = 1..10000</a> (first 154 terms from Antti Karttunen)
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A266197 (MATCHING-POS 1 1 (lambda (n) (= (A070939 (A266195 n)) (A070939 (A266195 (+ 1 n)))))))
%Y Cf. A070939, A264982, A266195.
%Y Cf. A265748, A265749 (give the first and second members of pairs indexed by this sequence).
%K nonn,base
%O 1,1
%A _Antti Karttunen_, Dec 26 2015