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 A260477 #24 Aug 31 2015 20:24:42 %S A260477 9,17,33,49,50,65,73,77,85,86,97,106,129,137,149,157,161,165,178,186, %T A260477 193,201,212,213,225,226,257,265,273,279,281,285,300,305,307,310,317, %U A260477 321,325,332,334,345,355,365,366,378,385,393,394,413,426,427,449,469 %N A260477 Numbers n where n^2 is an anagram of (n+1)^2 in base 2. %C A260477 Base 2 equivalent of A072841. %C A260477 It appears that one of these numbers has a 1/n chance of being divisible by an odd number n, but a smaller than 1/n chance if n is even. %H A260477 Charles R Greathouse IV, <a href="/A260477/b260477.txt">Table of n, a(n) for n = 1..10000</a> %e A260477 17 is a term of the sequence because its square base 2 (100100001) and 18's square base 2 (101000100) are anagrams. %t A260477 For[i = 1, i <= 10000, i++, %t A260477 If[Sort[IntegerDigits[i^2, 2]] == Sort[IntegerDigits[(i + 1)^2, 2]], %t A260477 Print[i]]] %o A260477 (PARI) is(n)=hammingweight(n^2)==hammingweight((n+1)^2) && #binary(n^2)==#binary((n+1)^2) \\ _Charles R Greathouse IV_, Aug 29 2015 %K A260477 base,easy,nonn %O A260477 1,1 %A A260477 _Dhilan Lahoti_, Aug 28 2015 %E A260477 a(27)-a(54) from _Charles R Greathouse IV_, Aug 29 2015