A292264 a(n) = n - A292944(n).

0, 1, 2, 2, 4, 4, 4, 5, 8, 8, 8, 9, 8, 8, 10, 11, 16, 16, 16, 17, 16, 16, 18, 19, 16, 16, 16, 17, 20, 20, 22, 23, 32, 32, 32, 33, 32, 32, 34, 35, 32, 32, 32, 33, 36, 36, 38, 39, 32, 32, 32, 33, 32, 32, 34, 35, 40, 40, 40, 41, 44, 44, 46, 47, 64, 64, 64, 65, 64, 64, 66, 67, 64, 64, 64, 65, 68, 68, 70, 71, 64, 64, 64, 65, 64, 64, 66, 67, 72, 72, 72, 73, 76, 76

Offset

0,3

Comments

Because A292263(n) = a(A243071(n)), the sequence works as a "masking function" where the 1-bits in a(n) (always a subset of the 1-bits in binary expansion of n) indicate which numbers are of the form 6k+1 or 6k+5 in binary tree A163511 (or in its mirror image tree A005940) on that trajectory which leads from the root of the tree to the node containing A163511(n).

Links

Antti Karttunen, Table of n, a(n) for n = 0..16383

Index entries for sequences related to binary expansion of n

Formula

a(n) = n - A292944(n).

a(n) = A292263(A163511(n)).

a(n) = A292942(n) + A292946(n).

a(n) = A292254(n) + A292256(n).

Prog

(Scheme) (define (A292264 n) (A292263 (A163511 n)))

Crossrefs

Cf. A005940, A163511, A292263.

Cf. A048735, A292944, A292272 but also A292254, A292256, A292942, A292946 for similarly constructed sequences.

Sequence in context: A084841 A144202 A157887 * A265263 A113320 A085237

Adjacent sequences: A292261 A292262 A292263 * A292265 A292266 A292267

Keyword

nonn,base

Author

Antti Karttunen, Sep 30 2017

Status

approved