# Calculate the least amount of needed repetitions to get n different sequences.

So let's say I have 4 variations. (ex: AA, AB, BA, BB)

And the sequence is 3 variations long. (ex: AA-BA-AB)

A repetition is when any sequence has used the same variation at the same spot as the current one.

So 'BB-BA-AB' and 'AA-AB-AB' has one repetition, but 'BB-BA-AB' and 'BB-AA-AB' has 2

So let's say I only need 4 sequences, then I would not need any repetitions (for the given possible variations and sequence length):

'AA-AB-BA', 'BB-BA-AA', 'AB-BB-AB', 'BA-AA-BB'

What I want is a formula that would be able to calculate it for any amount of variations, length, and amount of sequences needed.

Join Matchmaticians Affiliate Marketing
Program to earn up to a 50% commission on every question that your affiliated users ask or answer.

- unanswered
- 251 views
- Pro Bono

### Related Questions

- Calculate the imit of $\sum_{k=0}^{∞} (-1)^k\frac{1}{k!} $
- Taylor polynomial
- Prove that the following sequences monotnically decrease and increase correspondingly. Since they are bounded, find the limit.
- using maclaurin series for tan(x) and equation for length of cable to prove that x=
- Is $\sum_{n=1}^{\infty}\frac{\arctan (n!)}{n^2}$ convergent or divergent?
- Sum of infinite series
- Sequences undergrad
- Existence of a Divergent Subsequence to Infinity in Unbounded Sequences

Questions at this level should come with a bounty, otherwise you may not get an answer.

Calculate what exactly?

The least amount of repetitions/similarities needed to get n sequences (taking into account the amount of variations, the length of the sequences and the amount of sequences). So with the example given, if I only need 3 sequences, then the sequences don't need to have any repetitions or similarities to get the 3 sequences. But once I go higher to 5+, one of the sequences will have at least one similarity with another sequence.