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 #36 Jun 17 2015 08:59:01
%S 1,3,4,7,6,13,18,23,20,21,22,27,26,29,30,29,30,37,42,41,48,49,48,47,
%T 56,75,74,77,78,83,74,81,80,83,80,81,82,79,84,83,84,97,94,99,104,111,
%U 106,101,102,103,102,101,102,101,102,125,126,127,128,137,140
%N a(n) = n-th cumulative sum of A073602 divided by n-th prime.
%C a(n) is equal to prime(n) only for n=2, 4 and 6, that is, for primes 3, 7 and 13. - _Michel Marcus_, Jun 17 2015
%F a(n) = sum(i=1..n, A073602(n))/A000040(n).
%o (PARI) vsearch(n, v)=local(j, s); j=1; s=matsize(v)[2]; while(j<=s&&n!=v[j], j++); j<=s;
%o {m=54; v=[]; n=1; while(n<=m, p=2; while(vsearch(p, v)||((sum(j=1, matsize(v)[2], v[j])+p)%prime(n))>0, p=nextprime(p+1)); v=concat(v, p); n++); for (i=1, #v, print1(sum(k=1, i, v[k]/prime(i)), ", "))} \\ adapted from A073602; _Michel Marcus_, Jun 16 2015
%Y Cf. A000040, A073602.
%K nonn
%O 1,2
%A _Zak Seidov_, Jun 14 2015