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 A174695 #32 May 05 2019 01:55:31
%S A174695 0,0,1,0,1,0,1,0,1,2,1,0,1,0,1,2,3,2,1,2,1,0,1,2,1,2,1,2,1,2,1,2,3,2,
%T A174695 3,2,1,0,1,2,3,2,3,2,3,2,1,0,1,0,1,2,1,2,3,4,5,4,3,4,3,4,3,4,3,4,3,2,
%U A174695 3,2,3,4,3,2,1,2,3,2
%N A174695 Partial sums of A173950.
%C A174695 Since this sequence equals A112632(n)-1, and A007352 gives the primes at which the sign of A112632 changes, we have a change of sign in the present sequence not exactly at the primes listed in A007352, but earlier for changes to negative sign, and later for the opposite changes. Moreover, a change of sign in either of the sequences corresponds not necessarily to a change of sign (in the strict sense, i.e., regarding 0 as a number with the same sign as the preceding term) in the other one. - _M. F. Hasler_, Oct 09 2011
%H A174695 Franklin T. Adams-Watters, <a href="/A174695/b174695.txt">Table of n, a(n) for n = 1..10000</a>
%F A174695 a(n) = A112632(n)-1. - _M. F. Hasler_, Oct 09 2011
%p A174695 A173950 := proc(n) if (ithprime(n)+1) mod 6 = 0 then 1; elif (ithprime(n)-1) mod 6 = 0 then -1; else 0 ; end if; end proc:
%p A174695 A174695 := proc(n) add(A173950(i),i=1..n) ; end proc:
%p A174695 seq(A174695(n),n=1..90) ; # _R. J. Mathar_, Nov 30 2010
%t A174695 Accumulate[Table[Which[Divisible[Prime[n]+1,6],1,Divisible[Prime[n]-1,6],-1,True,0],{n,150}]] (* _Harvey P. Dale_, Apr 24 2019 *)
%o A174695 (PARI) s=0;forprime(p=1,999,print1(s+=if(p%3-1,p>3,-1)",")) \\ _M. F. Hasler_, Oct 09 2011
%Y A174695 Cf. A007352, A112632, A098044, A096630.
%Y A174695 Concerning zeros or changes of sign, see also A096449 and A275939.
%K A174695 sign
%O A174695 1,10
%A A174695 _Giovanni Teofilatto_, Nov 30 2010