An algorithm for generation of nonlinear de Brijn sequences

For an arbitrary number $n$ an algorithm is proposed which generates around $2^{n^2-5n}$ nonlinear binary sequences of maximal lenght $2^n$ which use about $n^2-4n$ memory bits and a maximum of $2n-2$ time cycles for generation of a subsequent symbol as a function of $n$ preceding ones.