%I #20 Sep 23 2017 03:18:56
%S 0,0,1,1,1,1,2,2,2,3,1,2,1,2,3,3,3,3,2,3,5,3,2,3,2,3,2,3,2,3,4,4,4,4,
%T 3,5,4,3,3,4,4,7,5,3,5,4,3,4,3,3,3,3,5,5,2,4,3,4,2,4,3,4,5,5,5,5,4,5,
%U 5,4,4,5,8,5,4,5,4,4,4,5,5,5,4,7,9,5,6,4,4,5,8,4,6,5,4,5,4,4,4,5,4,5,3,4,4
%N a(n) = number of distinct substrings in the binary representation of n that each occur multiple times.
%C Substrings may start with a 0.
%H Alois P. Heinz, <a href="/A141298/b141298.txt">Table of n, a(n) for n = 1..10000</a>
%e The distinct substrings that occur multiple times in decimal 10 = binary 1010 are 0,1 and 10. So a(10)=3.
%t Table[With[{d = IntegerDigits[n, 2]}, Count[Split@ Sort@ Apply[Join, Table[Partition[d, k, 1], {k, Length@ d}]], _?(Length@ # > 1 &)]], {n, 105}] (* _Michael De Vlieger_, Sep 22 2017 *)
%Y Cf. A141297, A141299, A141300.
%K nonn
%O 1,7
%A _Leroy Quet_, Jun 24 2008
%E Extended by _Ray Chandler_, Jun 25 2009