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 A140191 #6 May 05 2014 15:02:13 %S A140191 1,1,1,2,1,1,2,3,1,2,1,3,2,3,3,6,1,1,2,3,1,2,3,5,2,3,3,6,3,5,6,11,1,2, %T A140191 1,3,2,3,3,6,1,3,2,5,3,6,5,11,2,3,3,6,3,5,6,11,3,6,5,11,6,11,11,22,1, %U A140191 1,2,3,1,2,3,5,2,3,3,6,3,5,6,11,1,2,3,5,2,5,5,10,3,5,6,11,5,10,11,21,2,3,3,6 %N A140191 Fix e = 3; a(n) gives number of multiples ke (0 <= k <= n/e) which are children of n. %C A140191 A number m is a child of n if the binary representation of n has a 1 in every position where the binary representation of m has a 1. %H A140191 Nadia Heninger and N. J. A. Sloane, <a href="/A140191/b140191.txt">Table of n, a(n) for n = 0..3000</a> %H A140191 N. J. A. Sloane, <a href="/A140191/a140191.f.txt">Fortran program for this and related sequences</a> %o A140191 (Fortran) See Sloane link. %Y A140191 Cf. A140192-A140195. %K A140191 nonn %O A140191 0,4 %A A140191 _Nadia Heninger_ and _N. J. A. Sloane_, Jun 06 2008