A266197 - OEIS

A266197

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.

2, 4, 5, 9, 10, 18, 19, 26, 34, 37, 38, 58, 61, 62, 66, 67, 129, 130, 133, 137, 138, 158, 286, 287, 290, 292, 301, 302, 311, 318, 365, 366, 371, 379, 382, 384, 561, 562, 563, 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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Numbers n for which A264982(n) = A264982(n+1).

It would be nice to know whether this sequence is infinite.

LINKS

Rémy Sigrist, Table of n, a(n) for n = 1..10000 (first 154 terms from Antti Karttunen)

PROG

(Scheme, with Antti Karttunen's IntSeq-library)

(define A266197 (MATCHING-POS 1 1 (lambda (n) (= (A070939 (A266195 n)) (A070939 (A266195 (+ 1 n)))))))

CROSSREFS