login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A294487
Sum of the lengths of the distinct rectangles with prime length and integer width such that L + W = n, W < L.
1
0, 0, 2, 3, 3, 5, 5, 12, 12, 7, 7, 18, 18, 24, 24, 24, 24, 41, 41, 60, 60, 49, 49, 72, 72, 59, 59, 59, 59, 88, 88, 119, 119, 102, 102, 102, 102, 120, 120, 120, 120, 161, 161, 204, 204, 181, 181, 228, 228, 228, 228, 228, 228, 281, 281, 281, 281, 252, 252, 311
OFFSET
1,3
COMMENTS
Sum of the largest parts of the partitions of n into two distinct parts with largest part prime.
FORMULA
a(n) = Sum_{i=1..floor((n-1)/2)} (n-i) * A010051(n-i).
a(n) = n*A294602(n) - A368058(n). - Wesley Ivan Hurt, Dec 09 2023
EXAMPLE
a(14) = 24; the rectangles are 1 X 13 and 3 X 11 (7 X 7 is not considered since W < L). The sum of the lengths is then 13 + 11 = 24.
MATHEMATICA
Table[ Sum[(n - i)*(PrimePi[n - i] - PrimePi[n - i - 1]), {i, Floor[(n-1)/2]}], {n, 60}]
PROG
(PARI) a(n) = sum(i=1, (n-1)\2, (n-i)*isprime(n-i)); \\ Michel Marcus, Nov 08 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Wesley Ivan Hurt, Oct 31 2017
STATUS
approved