|
Search: id:A071778
|
|
|
| A071778 |
|
Number of ordered triples (a, b, c) with gcd(a, b, c) = 1 and 1 <= {a, b, c} <= n. |
|
+0
9
|
|
| 1, 7, 25, 55, 115, 181, 307, 439, 637, 841, 1171, 1447, 1915, 2329, 2881, 3433, 4249, 4879, 5905, 6745, 7861, 8911, 10429, 11557, 13297, 14773, 16663, 18355, 20791, 22495, 25285, 27541, 30361, 32905, 36289, 38845, 42841, 46027, 49987, 53395
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
IBM Ponder This, Jun 01 2002
Eric Weisstein's World of Mathematics, GCD
|
|
FORMULA
|
a(n)=sum(k=1, n, mu(k)*floor(n/k)^3) - Benoit Cloitre (benoit7848c(AT)orange.fr), May 11 2003
a(n) = n^3 - Sum(a(floor(n/j)), j=2..n). - Vladeta Jovovic (vladeta(AT)eunet.rs), Nov 30 2004
|
|
MAPLE
|
f:=proc(n) local i, j, k, t1, t2, t3; t1:=0; for i from 1 to n do for j from 1 to n do t2:=gcd(i, j); for k from 1 to n do t3:=gcd(t2, k); if t3 = 1 then t1:=t1+1; fi; od: od: od: t1; end;
|
|
PROGRAM
|
(Java) public class Triples { public static void main(String[] argv) { int i, j, k, a, m, n, d; boolean cf; try {a = Integer.parseInt(argv[0]); } catch (Exception e) {a = 10; }
for (m = 1; m <= a; m++) { n = 0; for (i = 1; i <= m; i++) for (j = 1; j <= m; j++) for (k = 1; k <= m; k++) { cf = false; for (d = 2; d <= m; d++) cf = cf || ((i % d == 0) && (j % d == 0) && (k % d == 0)); if (!cf) n++; } System.out.println(m + ": " + n); } } }
(PARI) a(n)=sum(k=1, n, moebius(k)*floor(n/k)^3)
|
|
CROSSREFS
|
Cf. A018805 (ordered pairs).
Sequence in context: A094672 A155286 A155313 this_sequence A155250 A155260 A155244
Adjacent sequences: A071775 A071776 A071777 this_sequence A071779 A071780 A071781
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Michael Malak (mmalak(AT)alum.mit.edu), Jun 04 2002
|
|
|
Search completed in 0.002 seconds
|
