title: Find all N-digit binary numbers with a limit of reps of 1 and 0
body: <p>Need some suggestions for an algorithm for the second part of the task with the R.</p>
  <p>With input of two given posititve integers N and R find all N-digit binary numbers with
  R the largest run length of each digit, the number of times the same digit can appear in a row in the number one after other as a sequence.</p>
  <p>for R equal to 2,  2 is a maximum of digits 0 that can appear in a row in the number notation (next should be digit 1). The same is true for digit 1 sequences.</p>
  <p>N can't be larger than 64.
  Output can be unsorted</p>
  <p>with input of</p>
  <pre><code>N = 5 R = 1
  </code></pre>
  <pre><code>output:
  1
  10
  101
  1010
  10101
  Total: 5
  </code></pre>
  <hr />
  <pre><code>input:
  N = 4, R = 2
  </code></pre>
  <pre><code>output:
  1
  11
  110
  1100
  1101
  10
  100
  1001
  101
  1011
  1010
  Total: 11
  </code></pre>
  <hr />
  <pre><code>input:
  N = 12, R = 6
  </code></pre>
  <pre><code>output:
  1
  11
  111
  1111
  11111
  111111
  1111110
  11111100
  111111000
  1111110000
  11111100000
  111111000000
  111111000001
  11111100001
  ...
  101010101011
  101010101010
  Total: 3903
  </code></pre>