[go: up one dir, main page]

login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A259446
Number of triangles with sides pairwise relatively prime and no greater than n; permutations of sides are not considered distinct.
2
1, 1, 1, 1, 2, 2, 5, 7, 11, 12, 23, 25, 42, 48, 56, 65, 97, 103, 145, 157, 179, 194, 258, 270, 326, 351, 400, 425, 532, 544, 668, 719, 783, 828, 914, 941, 1121, 1180, 1271, 1316, 1541, 1571, 1821, 1902, 1998, 2085, 2387, 2442, 2705, 2787
OFFSET
1,5
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
EXAMPLE
(1,1,1) is the only triangle up to n=4; (3,4,5) is added for n=5 and n=6.
MATHEMATICA
triangles[n_] := Module[{count = 0},
For[a = 1, a <= n, a++,
For[b = a, b <= n, b++,
For[c = b, c <= n, c++,
If[(a + b > c) && (b + c > a) && (c + a > b) && CoprimeQ[a, b, c],
count++]]]];
count];
triangles[#] & /@ Range[50]
PROG
(PARI) a(n)=sum(a=3, n-2, sum(b=a+1, n-1, if(gcd(a, b)==1, sum(c=b+1, min(a+b-1, n), gcd(a*b, c)==1))))+1 \\ Charles R Greathouse IV, Jun 29 2015
CROSSREFS
Sequence in context: A239737 A262883 A308908 * A265769 A308957 A240488
KEYWORD
nonn
AUTHOR
Vincent J. Matsko, Jun 27 2015
STATUS
approved