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.
%I A056929 #22 Jul 02 2025 16:02:00
%S A056929 0,0,1,-1,2,-1,0,0,1,1,0,-1,1,0,2,1,0,-2,1,0,1,-3,2,0,1,-1,4,-5,3,1,
%T A056929 -2,0,-2,-1,2,-1,1,4,1,0,-4,-5,-5,3,-5,-1,1,-4,10,0,1,-2,3,-5,7,9,-2,
%U A056929 1,0,-2,4,-9,0,1,3,1,-5,-10,4,-4,0,1,2,-6,12,-4,0,3,-9,3,-2,-2,6,1,-6,2,-3
%N A056929 Difference between n^2 and average of smallest prime greater than n^2 and largest prime less than n^2.
%C A056929 Conjecture: the most frequent value will be 1 (including sequence variants with any even power n^2k). - _Bill McEachen_, Dec 12 2022
%H A056929 Hugo Pfoertner, <a href="/A056929/b056929.txt">Table of n, a(n) for n = 2..10000</a>
%F A056929 a(n) = A000290(n) - A056928(n).
%F A056929 a(n) = (A056927(n) - A053000(n))/2.
%e A056929 a(4)=1 because smallest prime greater than 4^2 is 17, largest prime less than 4^2 is 13, average of 17 and 13 is 15 and 16-15=1.
%p A056929 with(numtheory): A056929 := n-> n^2-(prevprime(n^2)+nextprime(n^2))/2);
%t A056929 Array[# - Mean@ {NextPrime[#], NextPrime[#, -1]} &[#^2] &, 87, 2] (* _Michael De Vlieger_, May 20 2018 *)
%o A056929 (PARI) a(n) = n^2 - (nextprime(n^2) + precprime(n^2))/2; \\ _Michel Marcus_, May 20 2018
%Y A056929 Cf. A007491, A053000, A053001, A056927, A056928, A056930, A056931.
%K A056929 easy,sign
%O A056929 2,5
%A A056929 _Henry Bottomley_, Jul 12 2000
%E A056929 More terms from _James Sellers_, Jul 13 2000