login
A225526
Number of distinct products i*j over all pairs (i,j) with |i| + |j| <= n and gcd(i,j) <= 1.
2
1, 1, 3, 5, 7, 11, 13, 17, 21, 27, 31, 39, 43, 51, 57, 63, 69, 81, 87, 99, 107, 117, 125, 139, 147, 159, 169, 183, 195, 215, 223, 241, 257, 273, 287, 305, 315, 339, 353, 371, 383, 407, 419, 443, 461, 479, 497, 523, 539, 567, 585
OFFSET
0,3
COMMENTS
This sequence is in reply to an extension request made in A100449.
Note that gcd(0,m) = m for any m.
LINKS
MATHEMATICA
f[n_]:=Length[Complement[Union[Flatten[Table[If[Abs[i]+Abs[j]<=n&&GCD[i, j]<=1, {i*j}], {i, -n, n}, {j, -n, n}], 1]], {Null}]]; Table[f[n], {n, 0, 100}]
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Robert Price, May 09 2013
STATUS
approved