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