Pentagonal numbers made from pentagonal numbers
CJam, 29 bytes

6e5{)_3*(*2/}%_A4#&lt;riew::+&amp;1&lt;


Try it online.

Takes a couple of seconds to run.

Explanation

First, we need to check how many pentagonal numbers we need to consider as potential sums. The sum of the first 10,000 pentagonal numbers is 500050000000. The first pentagonal number greater than that is the 577,380th.

6e5       e# 600,000 (a short number that's a bit bigger than we need).
{         e# Map this block onto every number from 0 to 599,999...
  )       e#   Increment.
  _3*(*2/ e#   Apply the pentagonal number formula given in the challenge.
}%
_         e# Make a copy.
A4#&lt;      e# Truncate to the first 10,000 elements.
ri        e# Read input and convert to integer.
ew        e# Get sublists of that length.
::+       e# Sum each sublist.
&amp;         e# Set intersection with all 600k pentagonal numbers computed earlier.
1&lt;        e# Truncate to the first result.


I used a slightly modified program to find the largest inputs which yield a non-empty solution. These are all the solutions for inputs greater than 9,000:

9919 -&gt; 496458299155
9577 -&gt; 446991927537
9499 -&gt; 455533474060
9241 -&gt; 401702906276
9017 -&gt; 429351677617