Math Formulas, Practice, Tests, Forums, Free Help

I got a sequence that goes as follows: (1,1,1,1), (1,1,1,2), ... ,(4,4,4,4) (order matters here) which would give me 256 unique outcomes. My problem now is the following: I want to have the least amount of inputs, if the program i was typing the sequence into would perform a check for uniqueness for the last four digits entered. It basically wants one particular random four digit "lucky combo" out of (1,1,1,1) to (4,4,4,4) while the input sequence can be how ever long it wants. When ever that random combo is found the program picks a new random 4 digit combo. So there should be a universal sequence of numbers that always finds any random combo the program wants like (1,1,1,1,x,x,x, ..., 4,4,4,4) while being much more compact than (1,1,1,1), (1,1,1,2), ... ,(4,4,4,4) . For example i could do (1,1,1,1,2) instead of (1,1,1,1) and (1,1,1,2). I hope this doesnt sound to convuluted, how would i go about this?

Create a new topic(no registration) ->

Proof of Collatz Conjecture
Randomness can be a useful tool for solving problems.
Fusion reactors: Not what they’re cracked up to be?
solving integrals

Fundamental Math
Polygons
Parallel Lines Cut by a Transversal

Word Problems
Trigonometry & Trigonometric Formulas

Area Formulas
Line Slope