cp's OEIS Frontend

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.

A066033 Alternating sum of primes: a(1) = A000040(1) = 2 and a(n) = a(n-1) + A000040(n)*(-1)^n for n > 1.

This page as a plain text file.
%I A066033 #24 Aug 29 2024 11:13:11
%S A066033 2,5,0,7,-4,9,-8,11,-12,17,-14,23,-18,25,-22,31,-28,33,-34,37,-36,43,
%T A066033 -40,49,-48,53,-50,57,-52,61,-66,65,-72,67,-82,69,-88,75,-92,81,-98,
%U A066033 83,-108,85,-112,87,-124,99,-128,101,-132,107,-134,117,-140,123,-146,125,-152,129,-154,139,-168,143,-170,147,-184,153
%N A066033 Alternating sum of primes: a(1) = A000040(1) = 2 and a(n) = a(n-1) + A000040(n)*(-1)^n for n > 1.
%H A066033 Harry J. Smith, <a href="/A066033/b066033.txt">Table of n, a(n) for n=1..1000</a>
%F A066033 a(n) = 4 + (-1)^n*A008347(n). - _Robert Israel_, Jun 14 2016
%p A066033 ListTools:-PartialSums([2,seq((-1)^n*ithprime(n),n=2..100)]); # _Robert Israel_, Jun 14 2016
%t A066033 4 + Accumulate[Table[Prime[n](-1)^(n), {n, 1, 70}]] (* _Terry D. Grant_, Jun 14 2016 *)
%o A066033 (PARI) { for (n=1, 1000, if (n==1, a=2, a+=prime(n)*(-1)^n); write("b066033.txt", n, " ", a) ) } \\ _Harry J. Smith_, Nov 07 2009
%Y A066033 Cf. A007504, A008347, A000040.
%K A066033 sign
%O A066033 1,1
%A A066033 _Reinhard Zumkeller_, Dec 12 2001