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 A269633 #11 Apr 13 2019 14:24:09 %S A269633 1,9,21,93,381,6596,20995,24573,57823,62359,98756,208148,393213, %T A269633 400844,405788,418756,1572861,6460508 %N A269633 Numbers whose arithmetic derivative is equal to their BCR, where BCR = A036044, binary-complement-and-reverse = take one's complement then reverse bit order. %F A269633 Solution of the equation A003415(n) = A036044(n). %e A269633 9 is 1001 in base 2; complement: 0110; reverse: 0110 that is 6 in base 10 and 9' = 6; %e A269633 21 is 10101 in base 2; complement: 01010; reverse: 01010 that is 10 in base 10 and 21' = 10. %p A269633 P:=proc(q) local a,b, k,n,p; %p A269633 for n from 1 to q do a:=convert(n,base,2); b:=0; %p A269633 for k from 1 to nops(a) do if a[k]=0 then a[k]:=1 else a[k]:=0; fi; b:=2*b+a[k]; od; %p A269633 if b=n*add(op(2,p)/op(1,p),p=ifactors(n)[2]) then print(n); fi; %p A269633 od; end: P(10^6); %t A269633 f[n_] := If[Abs@ n < 2, 0, n Total[#2/#1 & @@@ FactorInteger@ Abs@ n]]; g[n_] := FromDigits[Reverse[IntegerDigits[n, 2] /. {1 -> 0, 0 -> 1}], 2]; Select[Range[10^6], f@ # == g@ # &] (* _Michael De Vlieger_, Mar 03 2016, after _Michael Somos_ at A003415 and _Harvey P. Dale_ at A036044 *) %Y A269633 Cf. A003415, A036044. %K A269633 nonn,base,more %O A269633 1,2 %A A269633 _Paolo P. Lava_, Mar 02 2016