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 A226472 #7 Jun 12 2013 13:29:45
%S A226472 0,1,6,8,4086,24136,162297,7868054,29792904,22666693375
%N A226472 Numbers n such that n^2 XOR triangular(n) is a perfect square. XOR is the bitwise logical exclusive-or operator.
%C A226472 Indices of perfect squares in A226470. No other terms below 2^35. Roots of generated squares: 0, 0, 7, 10, 2915, 29506, 149434, 6328037, 27602118, 20243443647.
%e A226472 8^2 XOR triangular(8) = 64 XOR 36 = 100, because 100 is a perfect square, 8 is in the sequence.
%o A226472 (C)
%o A226472 #include <stdio.h>
%o A226472 #include <math.h>
%o A226472 int main() {
%o A226472 for (unsigned long long a, r, n=0; n < (1ULL<<32); ++n) {
%o A226472 a = (n*n) ^ (n*(n+1)/2);
%o A226472 r = sqrt(a);
%o A226472 if (r*r==a) printf("%llu, ", n);
%o A226472 }
%o A226472 return 0;
%o A226472 }
%Y A226472 Cf. A000217, A000290, A226470, A221643.
%K A226472 nonn,more,base
%O A226472 1,3
%A A226472 _Alex Ratushnyak_, Jun 08 2013