The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A307736 Sum of the largest sides of all acute integer triangles with perimeter n. 1
 0, 0, 1, 0, 2, 2, 3, 3, 7, 8, 9, 9, 16, 11, 24, 19, 35, 28, 39, 40, 42, 53, 56, 57, 71, 73, 98, 90, 118, 107, 126, 128, 146, 164, 170, 172, 210, 198, 252, 224, 283, 268, 295, 318, 325, 370, 379, 384, 435, 442, 492, 480, 534, 563, 576, 606, 641, 699, 713, 694 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS Wikipedia, Integer Triangle FORMULA a(n) = Sum_{k=1..floor(n/3)} Sum_{i=k..floor((n-k)/2)} (1-sign(floor((n-i-k)^2/(i^2+k^2)))) * sign(floor((i+k)/(n-i-k+1))) * (n-i-k). MATHEMATICA Table[Sum[Sum[(n - i - k)*(1 - Sign[Floor[(n - i - k)^2/(i^2 + k^2)]]) Sign[Floor[(i + k)/(n - i - k + 1)]], {i, k, Floor[(n - k)/2]}], {k, Floor[n/3]}], {n, 150}] CROSSREFS Cf. A307729. Sequence in context: A330950 A032060 A241385 * A309713 A153903 A331729 Adjacent sequences:  A307733 A307734 A307735 * A307737 A307738 A307739 KEYWORD nonn AUTHOR Wesley Ivan Hurt, May 15 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 26 09:38 EST 2020. Contains 338639 sequences. (Running on oeis4.)