The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A223133 Number of distinct sums i+j+k with i,j,k >= 0, i*j*k <= n and gcd(i,j,k) <= 1. 5
 1, 4, 5, 6, 8, 10, 11, 14, 15, 18, 19, 22, 23, 26, 27, 30, 31, 34, 35, 38, 39, 42, 43, 46, 47, 50, 51, 54, 55, 58, 59, 62, 63, 66, 67, 70, 71, 74, 75, 78, 79, 82, 83, 86, 87, 90, 91, 94, 95, 98, 99, 102, 103, 106, 107, 110, 111, 114, 115, 118, 119, 122, 123 (list; graph; refs; listen; history; text; internal format)
 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[i*j*k <= n && GCD[i, j, k] <= 1, {i + j + k}], {i, 0, n}, {j, 0, n}, {k, 0, n}], 2]], {Null}]]; Table[f[n], {n, 0, 100}] CROSSREFS Cf. A226357, A226359, A222945, A222947. Sequence in context: A272054 A037354 A328983 * A295485 A226746 A206416 Adjacent sequences: A223130 A223131 A223132 * A223134 A223135 A223136 KEYWORD nonn AUTHOR Robert Price, Jun 12 2013 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 27 10:03 EST 2022. Contains 358367 sequences. (Running on oeis4.)