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

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A261465 a(n) = prime(n+1)^2 - prime(n). 0
 7, 22, 44, 114, 158, 276, 344, 510, 818, 932, 1338, 1644, 1808, 2166, 2762, 3428, 3662, 4428, 4974, 5258, 6168, 6810, 7838, 9320, 10104, 10508, 11346, 11774, 12660, 16016, 17034, 18638, 19184, 22062, 22652, 24498, 26412, 27726, 29762 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA a(n) = A036689(n+1) - A001223(n). - Michel Marcus, Aug 21 2015 a(n) ~ n^2 log^2 n. - Charles R Greathouse IV, Aug 22 2015 EXAMPLE a(2) = 5^2 - 3 = 22. MATHEMATICA Table[Prime[n + 1]^2 - Prime[n], {n, 60}] (* Vincenzo Librandi, Aug 20 2015 *) PROG (PARI) first(m)=vector(m, i, prime(i+1)^2 - prime(i)) \\ Anders Hellström, Aug 20 2015 (PARI) a(n, p=prime(n)); nextprime(p+1)^2-p \\ Charles R Greathouse IV, Aug 22 2015 (PARI) first(n)=my(v=primes(n+1)); vector(n, i, v[i+1]^2-v[i]) \\ Charles R Greathouse IV, Aug 22 2015 (Magma) [NthPrime(n+1)^2-NthPrime(n): n in [1.. 70]]; // Vincenzo Librandi, Aug 20 2015 CROSSREFS Cf. A036689, A001223, A069482, A129701. Sequence in context: A171441 A341401 A320694 * A033954 A159227 A081274 Adjacent sequences: A261462 A261463 A261464 * A261466 A261467 A261468 KEYWORD nonn,easy AUTHOR Altug Alkan, Aug 20 2015 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 November 30 04:37 EST 2022. Contains 358431 sequences. (Running on oeis4.)