A284552 a(n) = A065621(n) modulo n.

0, 0, 1, 0, 3, 2, 4, 0, 7, 6, 9, 4, 8, 8, 4, 0, 15, 14, 17, 12, 19, 18, 13, 8, 16, 16, 20, 16, 8, 8, 4, 0, 31, 30, 33, 28, 35, 34, 29, 24, 39, 38, 41, 36, 27, 26, 21, 16, 32, 32, 36, 32, 40, 40, 36, 32, 16, 16, 20, 16, 8, 8, 4, 0, 63, 62, 65, 60, 67, 66, 61, 56, 71, 70, 73, 68, 59, 58, 53, 48, 79, 78, 81, 76, 83, 82, 77, 72, 55, 54, 57, 52, 43, 42

Offset

1,5

Links

Antti Karttunen, Table of n, a(n) for n = 1..8192

Index entries for sequences related to binary expansion of n

Formula

a(n) = A065621(n) modulo n.

Prog

(Scheme) (define (A284552 n) (modulo (A065621 n) n))
(Python)
def A284552(n): return (n^ (n&~-n)<<1)%n # Chai Wah Wu, Jun 29 2022

Crossrefs

Column 1 of A284270.

Cf. A065621.

Sequence in context: A127099 A004545 A127481 * A328564 A154879 A097673

Adjacent sequences: A284549 A284550 A284551 * A284553 A284554 A284555

Keyword

nonn,base

Author

Antti Karttunen, Apr 10 2017

Status

approved