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 A230721 #4 Oct 28 2013 17:48:31 %S A230721 1,3,5,9,11,17,25,27,33,41,45,49,65,67,73,81,85,89,101,105,109,115, %T A230721 119,129,161,163,169,177,181,185,197,201,205,211,215,225,245,249,253, %U A230721 259,263,273,283,287,297,309,315,321,385,387,393,401,405,409,421,425 %N A230721 Odd sorting numbers, cf. A003071. %C A230721 A003071(a(n)) mod 2 = 1; %C A230721 a(n) = A003071(A230709(n+1)). %H A230721 Reinhard Zumkeller, <a href="/A230721/b230721.txt">Table of n, a(n) for n = 1..10000</a> %H A230721 <a href="/index/So#sorting">Index entries for sequences related to sorting</a> %o A230721 (Haskell) %o A230721 a230721 = a003071 . a230709 . (+ 1) %o A230721 a230721_list = filter odd a003071_list %K A230721 nonn %O A230721 1,2 %A A230721 _Reinhard Zumkeller_, Oct 28 2013