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

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

Cf. A070939, A264982, A266195.

Cf. A265748, A265749 (give the first and second members of pairs indexed by this sequence).

Sequence in context: A320225 A070924 A351993 * A086638 A319423 A265748

Adjacent sequences: A266194 A266195 A266196 * A266198 A266199 A266200

Keyword

nonn,base

Author

Antti Karttunen, Dec 26 2015

Status

approved