This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A322018 #7 Nov 28 2018 20:59:01
%S A322018 0,0,3,0,7,4,7,0,15,8,11,8,15,12,15,0,31,16,19,16,23,20,23,16,31,24,
%T A322018 27,24,31,28,31,0,63,32,35,32,39,36,39,32,47,40,43,40,47,44,47,32,63,
%U A322018 48,51,48,55,52,55,48,63,56,59,56,63,60,63,0,127,64,67,64,71,68,71,64,79,72,75,72,79,76,79,64,95,80,83,80,87,84,87,80
%N A322018 a(n) = A006068(A129760(A003188(n))).
%C A322018 For all n, A207901(a(n)) divides A207901(n), and similarly for A302033.
%H A322018 Antti Karttunen, <a href="/A322018/b322018.txt">Table of n, a(n) for n = 0..16383</a>
%H A322018 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F A322018 a(n) = A006068(A129760(A003188(n))).
%o A322018 (PARI)
%o A322018 A003188(n) = bitxor(n, n>>1);
%o A322018 A006068(n)= { my(s=1, ns); while(1, ns = n >> s; if(0==ns, break()); n = bitxor(n, ns); s <<= 1; ); return (n); } \\ After code in A006068
%o A322018 A129760(n) = bitand(n,n-1); \\ From A129760
%o A322018 A322018(n) = A006068(A129760(A003188(n)));
%Y A322018 Cf. A003188, A006068, A035327, A129760.
%Y A322018 Cf. also A207901, A302033, A322017.
%K A322018 nonn
%O A322018 0,3
%A A322018 _Antti Karttunen_, Nov 27 2018