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 A141300 #11 Oct 24 2017 02:31:05 %S A141300 1,3,1,4,4,4,1,5,6,4,7,6,7,5,1,6,8,8,10,8,4,8,9,8,10,8,9,8,9,6,1,7,10, %T A141300 11,13,9,11,13,13,11,11,4,9,13,9,11,11,10,13,13,13,13,9,9,13,11,13,11, %U A141300 13,10,11,7,1,8,12,14,16,14,15,17,17,14,9,14,17,15,17,17,16,14,15,14,17 %N A141300 a(n) = number of distinct (nonempty) substrings in the binary representation of n that each occur exactly once. %C A141300 Substrings may start with a 0. %H A141300 Michael De Vlieger, <a href="/A141300/b141300.txt">Table of n, a(n) for n = 1..16384</a> %e A141300 In (decimal 10 =) binary 1010: 01, 101, 010, 1010 each occur exactly once. So a(10) = 4. %t A141300 Array[Function[d, Count[Tally@ Apply[Join, Map[Partition[d, #, 1] &, Range[Length@ d]]], _?(Last@ # == 1 &)]]@ IntegerDigits[#, 2] &, 83] (* _Michael De Vlieger_, Oct 23 2017 *) %Y A141300 Cf. A141297, A141298, A141299. %K A141300 nonn %O A141300 1,2 %A A141300 _Leroy Quet_, Jun 24 2008 %E A141300 Extended by _Ray Chandler_, Jun 25 2009