#include <bits/stdc++.h>
using namespace std;
const int MAXN = 20000000;
int maxSqr[MAXN];
int main() {
  int a, n;
  scanf("%d%d", &a, &n);
  int least = a;
  int most = a + n - 1;
  memset(maxSqr, 0, sizeof(int) * (most + 1));
  for (int i = 2;; i++) {
    int sqr = i * i;
    if (sqr > most) {
      break;
    }
    for (int j = sqr; j <= most; j += sqr) {
      maxSqr[j] = sqr;
    }
  }
  long long ans = 0;
  for (int i = least; i <= most; i++) {
    if (maxSqr[i] == 0) {
      ans += i;
    } else {
      ans += i / maxSqr[i];
    }
  }
  cout << ans << endl;
  return 0;
}
