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

%I #11 Jun 30 2022 08:39:49

%S 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,

%T 8,4,0,31,30,33,28,35,34,29,24,39,38,41,36,27,26,21,16,32,32,36,32,40,

%U 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

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

%H Antti Karttunen, <a href="/A284552/b284552.txt">Table of n, a(n) for n = 1..8192</a>

%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>

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

%o (Scheme) (define (A284552 n) (modulo (A065621 n) n))

%o (Python)

%o def A284552(n): return (n^ (n&~-n)<<1)%n # _Chai Wah Wu_, Jun 29 2022

%Y Column 1 of A284270.

%Y Cf. A065621.

%K nonn,base

%O 1,5

%A _Antti Karttunen_, Apr 10 2017