OFFSET
0,2
COMMENTS
Note that gcd(0,m) = m for any m.
LINKS
Robert Price, Table of n, a(n) for n = 0..100
MATHEMATICA
f[n_] := Length[Complement[Union[Flatten[Table[If[Abs[i*j*k] <= n && GCD[i, j, k] <= 1, {i, j, k}], {i, -n, n}, {j, -n, n}, {k, -n, n}], 2]], {Null}]]; Table[f[n], {n, 0, 100}]
CROSSREFS
|i| + |j| + |k| <= n instead of |i*j*k| <= n: A100450.
Distinct sums i+j+k with the GCD qualifier: A222947.
Distinct sums i+j+k without the GCD qualifier: A222945.
Distinct products i*j*k with or without the GCD qualifier is 2n+1: A005408.
With the further restriction i,j,k >= 0 ...
Distinct sums i+j+k <= n with the GCD qualifier: A223133.
Distinct sums i+j+k <= n without the GCD qualifier: A223134.
Distinct products i*j*k with or without the GCD qualifier is n+1: A000217(n+1).
Distinct sums i+j+k with i*j*k = n with the GCD qualifier: A223135.
Distinct sums i+j+k with i*j*k = n without the GCD qualifier: A226378.
Distinct products i*j*k with i*j*k = n with or without the GCD qualifier is trivial and always 1: A000012.
Ordered triples with the product <= n with the GCD qualifier: A226001.
Ordered triples with the product <= n without the GCD qualifier: A226600.
Ordered triples with the product = n with the GCD qualifier: A226602.
Ordered triples with the product = n without the GCD qualifier: A007425.
KEYWORD
nonn
AUTHOR
Robert Price, Jun 04 2013
STATUS
approved