Ordered list of binary sequences of multiple dimensions
Haskell, 78 bytes

import Data.List
f n=sortOn(\x-&gt;sum x:reverse(map(1-)x))$mapM id$[0,1]&lt;$[1..n]


Usage example: f 2 -> [[0,0],[0,1],[1,0],[1,1]].

How it works:

         [0,1]&lt;$[1..n]  -- make n copies of the list [0,1]
     mapM id            -- make all lists where the ith element is from the ith list.
                        -- that gives us all binary sequences
sortOn                  -- sort this list of list
    sum x               -- first by number of ones
      reverse(map(1-)x) -- then by the reversed list with bits flipped