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 A248477 #9 Oct 25 2014 14:57:39 %S A248477 1,35,7,911,13,15171921,2325,272931,333537,39414345474951,53555759,61, %T A248477 63656769,7173,75777981,838587,8991939597,99101103,105107,109,111113, %U A248477 115,117,119121123125127129131,133,135137,139141,143,145,147149,151,153155157,159161 %N A248477 Consider the partition of the positive odd integers into minimal blocks such that concatenation of numbers in each block is an odious number (A000069). Sequence lists the odious numbers obtained in this way. %C A248477 The numbers of the consecutive positive odd integers over blocks of the partition are 1,2,1,2,1,4,2,3,3,7,4,1,4,2,4,3,5,3,2,1,... %H A248477 Peter J. C. Moses, <a href="/A248477/b248477.txt">Table of n, a(n) for n = 1..1000</a> %e A248477 a(4)=911, since 9 is evil number, while 911 is odious. %Y A248477 Cf. A000069, A001969, A248009, A248138, A148140, A248171, A248172. %K A248477 nonn,base %O A248477 1,2 %A A248477 _Vladimir Shevelev_, Oct 07 2014 %E A248477 More terms from _Peter J. C. Moses_, Oct 08 2014