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 A227471 #10 Jul 21 2013 02:24:23 %S A227471 1,3,2,4,3,2,2,3,4,2,6,2,2,3,5,2,3,2,3,4,2,5,3,2,2,2,4,3,2,2,8,3,2,3, %T A227471 2,4,2,3,4,2,3,2,7,2,2,4,3,6,3,2,2,5,2,3,2,4,2,5,2,2,3,2,3,4,2,2,3,2, %U A227471 3,2,2,4,5,2,3,8,2,2,2,2,3,2,5,2,4,3,2,2,2 %N A227471 Position of first 0 in the binary representation of prime(n), starting the count of positions at 1 for the least significant bit. %C A227471 If no zero appears in the base-2 representation, the search "falls through" and addresses the (virtual) leading zero of that prime, see A035100. - _R. J. Mathar_, Jul 20 2013 %F A227471 a(n) = 1+A023512(n). - _Antti Karttunen_, Jul 13 2013 %Y A227471 Cf. A004676, A023512. %K A227471 nonn %O A227471 1,2 %A A227471 _Juri-Stepan Gerasimov_, Jul 12 2013