Our talk deals with the linear generation methods of binary and decimal-valued maximal-length sequences. We show their topological equivalence, provide necessary and sufficient conditions for that and find a matrix-homeomorphism whose rows are the consecutive Rademacher sequences. We investigate a number of maximal linear sequences and give its formula.  We demonstrate different patterns generated from the sequences, classify them and especially focus on ones whose shapes are similar to chaotic real-valued maps. It gives us an opportunity to establish a similarity in the statistical characteristics of both m-bit decimal integer and chaotic real-valued sequences on the one hand and  design a m-sequence generator with given autocorrelation properties on the other one.