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!)
A308119 Sum of the smallest side lengths of all integer-sided triangles with prime side lengths and perimeter n. 1
0, 0, 0, 0, 0, 2, 2, 2, 3, 0, 3, 2, 3, 0, 8, 2, 8, 0, 5, 0, 7, 0, 5, 2, 10, 0, 15, 2, 15, 0, 12, 0, 18, 0, 23, 2, 21, 0, 39, 2, 37, 0, 36, 0, 31, 0, 47, 2, 47, 0, 46, 0, 48, 0, 30, 0, 47, 0, 61, 2, 35, 0, 66, 2, 92, 0, 61, 0, 77, 0, 60, 0, 43, 0, 79, 2, 90 (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))) * c(i) * c(k) * c(n-i-k) * k, where c is the prime characteristic (A010051).
MATHEMATICA
Table[Sum[Sum[k (PrimePi[i] - PrimePi[i - 1]) (PrimePi[k] - PrimePi[k - 1]) (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: A305384 A112599 A347905 * A307299 A307298 A216674
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, May 13 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.)