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 A146527 #6 Apr 09 2014 10:16:34 %S A146527 0,0,0,1,0,1,0,2,2,1,0,3,1,2,1,3,2,3,2,3,2,2,0,5,5,3,2,5,2,4,1,4,4,3, %T A146527 3,4,3,4,3,5,4,3,2,5,3,3,1,7,6,7,6,6,4,4,3,8,8,5,3,8,4,5,2,5,5,5,4,4, %U A146527 4,5,3,6,4,5,4,6,5,6,4,7,6,6,4,6,4,5,3,8,7,6,5,7,4,5,2,9,8,8,8,9,7,8,7,9,8 %N A146527 a(n) = number of distinct composites, when each is represented in binary, that occur as substrings within the binary representation of n. %C A146527 a(n) = 0 for n equal to only the positive integers 1,2,3,5,7,11,23 (sequence A048278). %e A146527 20 in binary is 10100. The composites, when represented in binary, that can be found within 10100 are 4 = 100 in binary, 10 (decimal) = 1010 in binary and 20 itself = 10100 in binary. There are 3 of these composites, so a(20) = 3. %Y A146527 A078826 %K A146527 nonn %O A146527 1,8 %A A146527 _Leroy Quet_, Oct 30 2008 %E A146527 Extended by _Ray Chandler_, Nov 03 2008