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!)
A306426 Sum of the smallest side lengths of all integer-sided triangles with perimeter n whose largest side length is prime. 2
0, 0, 0, 0, 1, 2, 3, 2, 3, 0, 6, 5, 7, 4, 15, 9, 12, 9, 11, 6, 7, 0, 21, 20, 25, 22, 54, 48, 57, 47, 54, 40, 45, 27, 75, 65, 75, 61, 124, 105, 120, 110, 123, 109, 120, 102, 189, 166, 184, 155, 170, 135, 147, 125, 135, 109, 117, 87, 213, 199, 218, 200, 353 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
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))) * A010051(n-i-k) * k.
MATHEMATICA
Table[Sum[Sum[k (PrimePi[n - i - k] - PrimePi[n - i - k - 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: A059905 A295301 A308133 * A014836 A197262 A085032
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Jun 03 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 19 09:22 EDT 2024. Contains 371782 sequences. (Running on oeis4.)