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 A248140 #21 Nov 14 2014 07:55:16 %S A248140 2,7,3,2,3,3,4,5,5,2,2,2,4,2,2,2,2,2,3,5,2,4,3,4,2,3,3,3,3,3,3,4,9,2, %T A248140 2,2,2,7,5,3,2,3,2,4,4,4,2,3,4,2,3,4,3,4,2,2,3,2,2,2,9,2,5,2,5,4,4,2, %U A248140 4,4,2,3,3,8,3,2,2,3,2,3,2,2,2,4,2,4,3 %N A248140 Consider the partition of the consecutive odious numbers (A000069) into minimal blocks such that concatenation of numbers in each block is an evil number (A001969). Sequence gives the number of odious numbers in each block. %C A248140 The blocks of consecutive odious numbers of the partition are %C A248140 1,2| 4,7,8,11,13,14,16| 19,21,22|25,26| 28,31,32| 35,37,38| 41,42,44,47| 49,50,52,55,56| 59,61,62,64,67| 69,70| 73,74| 76,79|, etc. %Y A248140 Cf. A000069, A001969, A248138, A248145, A248146. %K A248140 nonn %O A248140 1,1 %A A248140 _Vladimir Shevelev_ and _Peter J. C. Moses_, Oct 02 2014