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 A177441 #2 Mar 30 2012 18:40:52
%S A177441 1,4,9,20,32,59,88,159,231,444,659,1262,1897,3814,1187707
%N A177441 Partial sums of A014597.
%C A177441 Partial sums of numbers n such that n^2 is a sum of distinct factorials. The subsequence of primes in this partial sum begins: 59, 659, 1187707. If there is a larger value (the sequence might be finite), a(n)^2 must be greater than 48! (about 1.24139 * 10^61).
%F A177441 a(n) = SUM[i=1..n] A014597(i) = SUM[i=1..n] {i such that i^2 is a sum of distinct factorials} = SUM[i=1..n] {i such that i^2 is a sum of distinct A000142(j)}.
%e A177441 a(15) = 1 + 3 + 5 + 11 + 12 + 27 + 29 + 71 + 72 + 213 + 215 + 603 + 635 + 1917 + 1183893 is prime.
%Y A177441 Cf. A000142, A014597, A025494, A051761, A059589.
%K A177441 hard,nonn
%O A177441 1,2
%A A177441 _Jonathan Vos Post_, May 08 2010