#include <bits/stdc++.h>
using namespace std;
int main() {
  int a, n, i, j;
  long long int count = 0;
  cin >> a;
  cin >> n;
  int N = a + n;
  int* div1 = new int[N + 1];
  int* sq = new int[N + 1];
  int* prime = new int[N + 1];
  int pcount = 0;
  for (i = 0; i <= N; ++i) {
    div1[i] = 0;
    sq[i] = 1;
  }
  for (i = 2; i <= N; ++i) {
    if (div1[i] == 0) {
      div1[i] = i;
      prime[pcount] = i;
      ++pcount;
    }
    for (j = 0; j < pcount && prime[j] <= div1[i] && prime[j] * i <= N; ++j) {
      div1[i * prime[j]] = prime[j];
      if (i % (sq[i] * prime[j]) == 0) {
        sq[i * prime[j]] = sq[i] * prime[j] * prime[j];
      } else {
        sq[i * prime[j]] = sq[i];
      }
    }
  }
  for (i = 0; i < n; ++i) {
    count += (a + i) / sq[a + i];
  }
  cout << count << "\n";
  delete[] div1;
  delete[] sq;
  return 0;
}
