This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A174652 #2 Mar 30 2012 18:40:52
%S A174652 1,3,20,5797,192900159414,7177905237579946589743785824843591,
%T A174652 369822356418414944143680173221426891716916679027557977938929258031497305419444723776968084111223998808
%N A174652 Partial sums of A002814.
%C A174652 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?
%F A174652 a(n) = SUM[i=0..n] A002814(i) = SUM[i=0..n] {a(n) = a(n-1)^3 + 3a(n-1)^2 - 3}.
%e A174652 a(3) = 1 + 2 + 17 + 5777 = 5797 = 11 * 17 * 31.
%Y A174652 Cf. A002814, A000045, A001566, A045529.
%K A174652 nonn
%O A174652 0,2
%A A174652 _Jonathan Vos Post_, Mar 25 2010