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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A308224 Sum of the largest sides of all integer-sided triangles with perimeter n whose side lengths are mutually coprime. 1
0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 7, 7, 0, 15, 0, 17, 9, 9, 11, 53, 11, 21, 37, 60, 26, 103, 13, 68, 28, 74, 49, 193, 34, 115, 106, 210, 74, 291, 76, 227, 97, 214, 107, 464, 132, 345, 205, 414, 117, 592, 198, 488, 223, 454, 214, 1037, 274, 591, 491 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,12
LINKS
Wikipedia, Integer Triangle
FORMULA
a(n) = Sum_{k=1..floor(n/3)} Sum_{i=k..floor((n-k)/2)} sign(floor((i+k)/(n-i-k+1))) * [gcd(i,k) * gcd(i,n-i-k) * gcd(k,n-i-k) = 1] * (n-i-k), where [] is the Iverson Bracket.
MATHEMATICA
Table[Sum[Sum[(n - i - k)*Floor[1/(GCD[i, k]*GCD[i, n - i - k]*GCD[k, n - i - k])]*Sign[Floor[(i + k)/(n - i - k + 1)]], {i, k, Floor[(n - k)/2]}], {k, Floor[n/3]}], {n, 100}]
CROSSREFS
Cf. A308223.
Sequence in context: A261852 A254293 A263496 * A200630 A198225 A256929
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, May 16 2019
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 20:26 EDT 2024. Contains 371781 sequences. (Running on oeis4.)