The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A161911 a(n) is the n-th difference between consecutive primes minus the number of divisors of n. 7
 0, 0, 0, 1, 0, 0, 0, 0, 3, -2, 4, -2, 0, 0, 2, 1, 0, 0, 2, -4, 2, 0, 4, 0, 1, -2, 0, -4, 2, 6, 2, 0, -2, 6, -2, -3, 4, 0, 2, -2, 0, 2, 0, -2, -4, 8, 10, -6, -1, -2, 2, -4, 8, -2, 2, -2, -2, 2, 2, -10, 8, 10, -2, -5, 0, 6, 4, 4, -2, -4, 4, -4, 4, 2, -2, 0, 4, -4, 6, 0, -3, 6, 0, -6, 0, 2, 4, -4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,9 LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 Omar E. Pol, Illustration: Divisors and pi(x) FORMULA a(n) = A001223(n) - A000005(n). MAPLE A001223 := proc(n) ithprime(n+1)-ithprime(n) ; end: A000005 := proc(n) numtheory[tau](n) ; end: A161911 := proc(n) A001223(n)-A000005(n) ; end: seq(A161911(n), n=1..120) ; # R. J. Mathar, Jul 01 2009 MATHEMATICA With[{nn=90}, #[[1]]-DivisorSigma[0, #[[2]]]&/@Thread[{Differences[Prime[ Range[ nn]]], Range[nn-1]}]] (* Harvey P. Dale, Oct 01 2018 *) CROSSREFS Cf. A000005, A001223, A161912. Sequence in context: A117623 A145690 A259053 * A139583 A073314 A144808 Adjacent sequences: A161908 A161909 A161910 * A161912 A161913 A161914 KEYWORD easy,sign AUTHOR Omar E. Pol, Jun 28 2009 EXTENSIONS More terms from R. J. Mathar, Jul 01 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 25 11:48 EDT 2024. Contains 373701 sequences. (Running on oeis4.)