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.

A145337 a(n) = d(p(n)+1) - d(p(n)-1), where d(m) = the number of divisors of m, p(n) = the n-th prime.

This page as a plain text file.
%I A145337 #15 Aug 06 2017 22:26:55
%S A145337 1,1,1,0,2,-2,1,0,4,2,-2,-5,0,-2,6,2,8,-8,-2,4,-8,2,8,4,-6,-1,0,8,-4,
%T A145337 -2,-4,4,0,4,6,-4,-8,-4,12,2,14,-10,6,-10,3,0,-10,4,8,-4,4,12,-14,10,
%U A145337 -1,12,10,-6,-8,-8,-2,6,0,8,-12,2,-10,-14,8,0,-4,20,2,-4,-4,12,10,-14,-7,-8
%N A145337 a(n) = d(p(n)+1) - d(p(n)-1), where d(m) = the number of divisors of m, p(n) = the n-th prime.
%H A145337 Harvey P. Dale, <a href="/A145337/b145337.txt">Table of n, a(n) for n = 0..1000</a>
%F A145337 a(n) = A008329(n) - A008328(n). - _R. J. Mathar_, Oct 10 2008
%p A145337 A000005 := proc(n) numtheory[tau](n) ; end:
%p A145337 A008328 := proc(n) A000005(ithprime(n)-1) ; end:
%p A145337 A008329 := proc(n) A000005(ithprime(n)+1) ; end:
%p A145337 A145337 := proc(n) A008329(n)-A008328(n) ; end: # _R. J. Mathar_, Oct 10 2008
%t A145337 DivisorSigma[0,#+1]-DivisorSigma[0,#-1]&/@Prime[Range[80]] (* _Harvey P. Dale_, Nov 01 2011 *)
%Y A145337 Cf. A008328, A008329, A067889, A103664, A103665, A145338.
%K A145337 sign
%O A145337 0,5
%A A145337 _Leroy Quet_, Oct 08 2008
%E A145337 More terms from _R. J. Mathar_ and _Ray Chandler_, Oct 10 2008