OFFSET
0,2
COMMENTS
Partial sums of an infinite coprime sequence defined by recursion. 3 is the only prime through a(6). Is it computationally feasible to find another?
FORMULA
a(n) = SUM[i=0..n] A002814(i) = SUM[i=0..n] {a(n) = a(n-1)^3 + 3a(n-1)^2 - 3}.
EXAMPLE
a(3) = 1 + 2 + 17 + 5777 = 5797 = 11 * 17 * 31.
CROSSREFS
KEYWORD
nonn
AUTHOR
Jonathan Vos Post, Mar 25 2010
STATUS
approved