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 A175919 #16 Mar 29 2019 13:20:01
%S A175919 0,0,3,0,5,0,5,0,9,0,15,6,15,6,9,0,17,0,27,10,17,0,27,10,27,10,17,0,
%T A175919 27,10,17,0,33,0,51,18,45,12,63,30,45,12,63,30,33,0,51,18,51,18,33,0,
%U A175919 63,30,45,12,63,30,45,12,51,18,33,0,65,0,99,34,85,20,119,54,65,0,99,34,85,20,119
%N A175919 Convert n to binary. XOR each respective digit of binary n and binary A030101(n), where A030101(n) is the reversal of the order of the digits in the binary representation of n (given in decimal). a(n) is the decimal value of the result.
%C A175919 Description format taken from _Leroy Quet_'s OR and AND gate sequences for consistency.
%H A175919 Alois P. Heinz, <a href="/A175919/b175919.txt">Table of n, a(n) for n = 0..16383</a>
%F A175919 a(n) = A003987(n, A030101(n)).
%t A175919 Table[f = IntegerDigits[x, 2]; f = f + Reverse[f]; FromDigits[ Table[If[OddQ[f[[r]]], 1, 0], {r, 1, Length[f]}], 2], {x, STARTPOINT,ENDPOINT}]
%Y A175919 Or A175298 and And A175297 gate sequences. The rest of the equivalent sequences for other gates are adjacent.
%Y A175919 Cf. A003987, A030101, A256756.
%K A175919 base,look,nonn
%O A175919 0,3
%A A175919 _Dylan Hamilton_, Oct 15 2010