Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Mar 23 2013 03:31:22
%S 1,10,109,522,3043,7838,21061,41110,81955,178510,302075,539382,885581,
%T 1297982,1869659,2758406,4076543,5566538,7670387,10274536,13158999,
%U 17017244,21645981,27634492,35865619,45423702,55700987,67534604,80208039,94691374
%N a(n) = sum of cubes of p(j) - p(i), for 0 <= i < j <= n, where p(0) = 1.
%o (PARI) p(n) = if (n==0, 1, prime(n));
%o a(n) = sum(i=0, n-1, sum(j=i+1, n, (p(j)-p(i))^3));
%o \\ _Michel Marcus_, Mar 23 2013
%K nonn
%O 1,2
%A _Clark Kimberling_