Cubist
Well-known Member
- Joined
- Oct 5, 2023
- Messages
- 2,139
- Office Version
- 365
- Platform
- Windows
- MacOS
Hi,
I'm wondering if this is possible with formula. Generating an alphabetical sequence of length m, and repetition of each element n times. m is assumed to be divisible by n. For example, m=10, n = 2.
I'm wondering if this is possible with formula. Generating an alphabetical sequence of length m, and repetition of each element n times. m is assumed to be divisible by n. For example, m=10, n = 2.
Book1 | |||||
---|---|---|---|---|---|
A | B | C | |||
1 | Length | 10 | |||
2 | Rep of each element | 2 | |||
3 | |||||
4 | A | ||||
5 | A | ||||
6 | B | ||||
7 | B | ||||
8 | C | ||||
9 | C | ||||
10 | D | ||||
11 | D | ||||
12 | E | ||||
13 | E | ||||
14 | |||||
Sheet3 |