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!)
 A204914 Ordered differences of squared primes. 4
 5, 21, 16, 45, 40, 24, 117, 112, 96, 72, 165, 160, 144, 120, 48, 285, 280, 264, 240, 168, 120, 357, 352, 336, 312, 240, 192, 72, 525, 520, 504, 480, 408, 360, 240, 168, 837, 832, 816, 792, 720, 672, 552, 480, 312, 957, 952, 936, 912, 840, 792, 672 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS For a guide to related sequences, see A204892. LINKS Michael S. Branicky, Table of n, a(n) for n = 1..10000 EXAMPLE a(1) = s(2) - s(1) = 9 - 4 = 5; a(2) = s(3) - s(1) = 25 - 4 = 21; a(3) = s(3) - s(2) = 25 - 9 = 16; a(4) = s(4) - s(1) = 49 - 4 = 45. MATHEMATICA (See the program at A204916.) PROG (Python) from math import isqrt from sympy import prime, primerange def aupton(terms): sqps = [p*p for p in primerange(1, prime(isqrt(2*terms)+1)+1)] return [b-a for i, b in enumerate(sqps) for a in sqps[:i]][:terms] print(aupton(52)) # Michael S. Branicky, May 21 2021 CROSSREFS Cf. A204908, A204900, A204892. Sequence in context: A053003 A346035 A167202 * A355036 A263130 A165204 Adjacent sequences: A204911 A204912 A204913 * A204915 A204916 A204917 KEYWORD nonn AUTHOR Clark Kimberling, Jan 20 2012 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 01:31 EST 2022. Contains 358431 sequences. (Running on oeis4.)