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!)
A308276 Sum of the smallest side lengths of all integer-sided triangles with perimeter n whose sides are square numbers. 2
0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 4, 0, 0, 0, 0, 0, 0, 1, 0, 0, 4, 0, 0, 0, 0, 9, 0, 0, 0, 0, 0, 1, 9, 0, 4, 0, 0, 0, 0, 9, 0, 0, 0, 0, 0, 0, 16, 0, 0, 1, 0, 0, 4, 0, 0, 16, 0, 9, 0, 0, 0, 0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 1, 0, 25, 4, 16, 0, 0, 0, 9, 0, 0, 0, 0 (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))) * A010052(i) * A010052(k) * A010052(n-i-k) * k.
MATHEMATICA
Table[Sum[Sum[k (Floor[Sqrt[i]] - Floor[Sqrt[i - 1]]) (Floor[Sqrt[k]] - Floor[Sqrt[k - 1]]) (Floor[Sqrt[n - k - i]] - Floor[Sqrt[n - k - i - 1]])*Sign[Floor[(i + k)/(n - i - k + 1)]], {i, k, Floor[(n - k)/2]}], {k, Floor[n/3]}], {n, 100}]
CROSSREFS
Sequence in context: A308426 A308429 A308428 * A340977 A180989 A075444
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, May 18 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 24 19:52 EDT 2024. Contains 371963 sequences. (Running on oeis4.)