A366378 Numbers k such that A057889(k) == k (mod 3), where A057889 is the bijective bit-reverse.

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 17, 18, 19, 20, 21, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 34, 36, 38, 39, 40, 42, 45, 46, 48, 50, 51, 54, 56, 57, 58, 60, 62, 63, 64, 65, 66, 67, 68, 69, 71, 72, 73, 75, 76, 77, 78, 79, 80, 81, 83, 84, 85, 87, 89, 90, 91, 92, 93, 95, 96, 97, 99, 100, 101, 102, 103

Offset

1,3

Links

Table of n, a(n) for n=1..81.

Prog

(PARI)
A030101(n) = if(n<1, 0, subst(Polrev(binary(n)), x, 2));
A057889(n) = if(!n, n, A030101(n/(2^valuation(n, 2))) * (2^valuation(n, 2)));
isA366378(n) = !((A057889(n)-n)%3);

Crossrefs

Cf. A030101, A057889, A366379 (complement), A366389.

Subsequences: A000079, A008585, A057890.

Sequence in context: A091402 A365513 A064817 * A108549 A045779 A235028

Adjacent sequences: A366375 A366376 A366377 * A366379 A366380 A366381

Keyword

nonn

Author

Antti Karttunen, Oct 22 2023

Status

approved