# [Vyxal](https://github.com/Vyxal/Vyxal), 1 byte
```
ǐ
```
[Try it Online!](https://vyxal.pythonanywhere.com/#WyIiLCIiLCLHkCIsIiIsIjIxNDc0ODM2NDYiXQ==)

Just the built-in. But that's boring, so

## [Vyxal](https://github.com/Vyxal/Vyxal), <s>16</s> 8 bytes

```
K~æ~Ǒ$ẋf
```
[Try it Online!](https://vyxal.pythonanywhere.com/#WyIiLCIiLCJLfsOmfseRJOG6i2YiLCIiLCIyMTQ3NDgzNjQ2Il0=)

## Explained

```
ʀ~æ~Ǒ$ẋf
ʀ~æ # From the all numbers in the range [0, input], keep only those that are prime
 ~Ǒ # Without popping anything, get the multiplicity of each prime divisor - this leaves the stack as [divisors, multiplicities]
 $ẋ # Swap the two items and repeat each divisor multiplicity times
 f # Flatten and output that 
```