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 A056894 #6 May 27 2017 03:00:08 %S A056894 1,1,4,9,36,25,16,81,64,49,36,49,100,225,64,81,576,121,144,441,256, %T A056894 169,144,169,256,225,196,289,324,961,400,729,400,529,324,361,484,441, %U A056894 400,529,576,529,576,729,784,841,900,625,1444,1521,676,961,900,1225,784 %N A056894 If the smallest prime with a square excess of n is p then a(n)=p-n. %F A056894 a(n) = A056893(n) - n = A048760(A056893(n)) = A056895(n)^2 %e A056894 a(4)=9 because the smallest prime with a square excess of 4 is 13 and 13-4=9 %Y A056894 Cf. A000040, A000196, A002496, A048760, A053186, A056892-A056898. %K A056894 nonn %O A056894 1,3 %A A056894 _Henry Bottomley_, Jul 05 2000