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).
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