So I was recently working on a routine to generate a list of prime numbers, optimizing for speed. This endeavor got me thinking about other, perhaps more complex, sequences that could be explored. One of the ones I've been exploring is values of the Mobius Function and was hoping to get some feedback on optimizing my code (it can currently get a list to N = 50 in 15 sec). If you have any other sequences that interest you, leave them here and the community can collaborate on generating them.

```
prgmPRIME //This is a separate program that generates all the primes up to N and stores them to L₁
{1→L₃
For(I,2,N
Delvar JClrList L₂
Repeat L≥L/2
J+1→J
L₁(J→L
If not(remainder(I,Ans
Ans→L₂(1+dim(L₂
If not(remainder(I,Ans²
0→L₂(1
End
If max(I=L₁
{1→L₂
(min(L₂)≠0)(-1)^dim(L₂→L₃(1+dim(L₃
End
```

List of Mobius Function values up to N are in L₃.

The solution to a complex problem is often a simple answer.