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 A099895 #9 May 11 2014 22:53:30
%S A099895 1,3,5,0,9,0,0,0,17,0,0,0,0,0,0,0,33,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,65,
%T A099895 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,129
%N A099895 XOR BINOMIAL transform of A000069 (Odious numbers).
%C A099895 See A099884 for the definitions of the XOR BINOMIAL transform and the XOR difference triangle.
%F A099895 a(2^n) = 2^(n+1)+1 for n>0, with a(0)=1 and a(k)=0 otherwise. a(n) = SumXOR_{i=0..n} (C(n, i)mod 2)*A000069(n-i) and SumXOR is summation under XOR.
%e A099895 XOR difference triangle of A000069 begins:
%e A099895 [1],
%e A099895 [2,3],
%e A099895 [4,6,5],
%e A099895 [7,3,5,0],
%e A099895 [8,15,12,9,9],
%e A099895 [11,3,12,0,9,0],
%e A099895 [13,6,5,9,9,0,0],
%e A099895 [14,3,5,0,9,0,0,0],
%e A099895 [16,30,29,24,24,17,17,17,17],...
%e A099895 where A000069 is in the leftmost column,
%e A099895 and this sequence forms the main diagonal.
%o A099895 (PARI) {a(n)=local(B);B=0;for(i=0,n,B=bitxor(B,binomial(n,i)%2*A000069(n-i) ));B}
%Y A099895 Cf. A099884, A000069, A099896.
%K A099895 nonn
%O A099895 0,2
%A A099895 _Paul D. Hanna_, Oct 29 2004