Upper bounds of plane circuits implemented autonomous automaton functions switchable power

Switchable power of flat automatic schema without inputs implementation by periodical sequence is recieved in this work. A scheme is given that implements arbitrary pre-defined sequence of length $ 2^n $ for positive integer n with switchable power no more than $ \frac{2^{n/2}}{n}$.