The integers from 0 through 2ⁿ-1 can be placed (with some repretitions) into a sequence such that all those integers whose i-th bit is a 1(i=1,2),..,n) will appear consecutively. This short paper extends that result to include, as well, subsequences of all integers whose i-th bit is 0 while achieving a minimum length sequence.