So, I've only tested this for prime numbers 1-1000. So I took two vectors, of prime numbers 1-1000 (one called p, one q) and took the permutations of each and multiply them to get "n"...you get 22, 23, 2*5 etc.
If I do this, I end up with all unique values for "n".
So in RSA security, wouldn't knowing n, allow a lookup list for the only combinations that create p and q? Or am I just using too small of a sample 1-1000 and when you goto 256bit numbers there are no longer unique values of n?
In theory, yes, you can have a lookup table.
In practice, there isn't enough matter in the universe for you to store a lookup table large enough to help you find $p$ and $q$ from knowing $n=pq$ if $n$ is large enough.
For example, try finding $p,q$ if you know only that $$pq=225256289274304442252547699446950738681574839866362153899638597892648020191112400204675149178567891$$