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 A099889 #12 Sep 01 2016 03:52:18
%S A099889 1,3,2,5,6,4,7,2,4,0,9,14,12,8,8,11,2,12,0,8,0,13,6,4,8,8,0,0,15,2,4,
%T A099889 0,8,0,0,0,17,30,28,24,24,16,16,16,16,19,2,28,0,24,0,16,0,16,0,21,6,4,
%U A099889 24,24,0,0,16,16,0,0,23,2,4,0,24,0,0,0,16,0,0,0,25,14,12,8,8,16,16,16,16,0
%N A099889 XOR difference triangle of the odd numbers, read by rows.
%C A099889 Main diagonal is A099890, the XOR BINOMIAL transform of the odd numbers. See A099884 for the definitions of the XOR BINOMIAL transform and the XOR difference triangle.
%H A099889 Ivan Neretin, <a href="/A099889/b099889.txt">Table of n, a(n) for n = 0..8000</a>
%F A099889 T(n, k) = SumXOR_{i=0..k} (C(k, i)mod 2)*(2*(n-i)+1), where SumXOR is the analog of summation under the binary XOR operation and C(k, i)mod 2 = A047999(k, i). T(2^n, 2^n) = 2^(n+1) for n>=0, with T(0, 0)=1.
%e A099889 Rows begin:
%e A099889 [1],
%e A099889 [3,2],
%e A099889 [5,6,4],
%e A099889 [7,2,4,0],
%e A099889 [9,14,12,8,8],
%e A099889 [11,2,12,0,8,0],
%e A099889 [13,6,4,8,8,0,0],
%e A099889 [15,2,4,0,8,0,0,0],
%e A099889 [17,30,28,24,24,16,16,16,16],...
%t A099889 mx = 14; Flatten@Table[NestList[BitXor @@@ Transpose[{Most@#, Rest@#}] &, Range[1, 2 mx, 2], mx][[k, n - k]], {n, 2, mx}, {k, n - 1}] (* _Ivan Neretin_, Sep 01 2016 *)
%o A099889 (PARI) T(n,k)=local(B);B=0;for(i=0,k,B=bitxor(B,binomial(k,i)%2*(2*(n-i)+1)));B
%Y A099889 Cf. A099884, A099890.
%K A099889 nonn,tabl
%O A099889 0,2
%A A099889 _Paul D. Hanna_, Oct 29 2004