In mathematics, is there a theory that deals with the distribution of numbers? Firstly, I have a hard time expressing my question. (English is my second language and I have no math education. If you know what I mean, please edit the question.)
Suppose, $a_{1,n} ; a_{2,n} ; a_{3,n} ;a_{4,n}; ...$ series are given. All the elements included in these series are Natural Numbers: $\left\{a_{1,n} ; a_{2,n} ; a_{3,n} ;a_{4,n}; ....\right\}\in \mathbb{Z^{+}}.$
I would like to give an example before asking my question.

$a_{1,n}= \left\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,... \right\}$
$a_{2,n}=\left\{1,3,4,5,6,7,8,9,13,15,17,19,20...\right\}$
$a_{3,n}=\left\{1,5,7,9,11,14,19,20...\right\}$

We see that, for sequence $a_{1,n}$ the distribution of numbers is more "orderly"  than for sequence $a_{2,n}.$ For sequence $a_{2,n}$ the distribution of numbers is more "orderly" for sequence $a_{3,n}.$ By "orderly", I mean the denser settlement of the positive integer numbers. We can define the sequence of $a_{1,n}$ as the "most orderly" sequence.
For example: The numbers in sequence $a_{4,n}$ are more "orderly distributed" than from sequence $a_{5,n}.$

$a_{4,n}=\left\{1,2,3,4,5,6,7,8,9,11,13,15,17,19,21,23,25 ...\right\}$
$a_{5,n}=\left\{1,7,9,13,17,19,21,23,25...\right\}$

How can I say that the sequence of $a_{3,n}$ is more "orderly" than the  sequence of $a_{5,n}?$
I can not say which sequences/series are more "orderly", because I have no mathematical criterion to do this. Is there a theory that deals with the distribution of positive integer numbers? For example, which sequence of numbers are more "orderly distributed?"
 A: I'm not sure to well interpret your question, but I think that what you are searching for may be something that is called algorithmic complexity (or other names that you can see here), applied to a sequence of integers numbers.  
Intuitively: 

the complexity of a sequence of number  is the minimum lenght of a program that generate exactly this sequence.

As an example, for your sequence $a_{1,n}$ you can think to something as:
1) write $1$
2) memorize the writed number
3) write the memorized number $+1$
4) go to 2)
This is a simple ''program'' that, in some programming language can be reduced to a minimum length, and this is assumed to be the ''complexity'' of the sequence.
The other sequences in your example can be generated by other programs with different minimum length, so we can compare the ''complexities'' of different sequences.
The maximum complexity is given, in such context, for a sequence that cannot be ''compressed'' in some set of rules that generates all the numbers in the sequence. This is the case if we chose ''randomly'' any element of the sequence so that we cannot write a program that generates the numbers, but we can only list them all.
All this gives you only a  partial flavor (not rigorous at all) of the fascinating theory that was developed by Kolmogorov and Chaitin in the years '60 where we encounter many questions about complexity, randomness and incompleteness.
A: Your line of thought is studied in calculus under the topics of sequences and subsequences. In your examples the $$ a_{1,n}= \left\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25... \right\}$$
is called a sequence $ (a_n)$ defined by $$a_n=n$$ for $n=1,2,3,...$
The next one $$a_{2,n}=\left\{1,3,5,7,9,11,13,15,17,19,21,23,25...\right\}$$
is a subsequence denoted by $$a_{2n-1}$$ and the next one $$a_{3,n}=\left\{1,5,9,13,17,21,25...\right\}$$
is denoted by $$a_{4n-3}$$
Notice that in a proper subsequence of a sequence,  the order is preserved and we are skipping some terms. 
It is not always possible to retrieve the sequence form one of its subsequences.
