cp's OEIS Frontend

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.

A056896 Smallest prime which can be written as k^2 + n for k >= 0.

This page as a plain text file.
%I A056896 #11 Aug 27 2025 05:54:12
%S A056896 2,2,3,5,5,7,7,17,13,11,11,13,13,23,19,17,17,19,19,29,37,23,23,73,29,
%T A056896 107,31,29,29,31,31,41,37,43,71,37,37,47,43,41,41,43,43,53,61,47,47,
%U A056896 73,53,59,67,53,53,79,59,137,61,59,59,61,61,71,67,73,101,67,67,149,73,71
%N A056896 Smallest prime which can be written as k^2 + n for k >= 0.
%F A056896 a(n) = A056897(n)+n = A056898(n)^2+n.
%F A056896 For p a prime: a(p)=p (and a(p-1)=p if p<>3).
%e A056896 a(8)=17 because 17=3^2+8.
%t A056896 Table[k = 0; While[p = n + k^2; ! PrimeQ[p], k++]; p, {n, 100}] (* _T. D. Noe_, Apr 01 2011 *)
%Y A056896 Cf. A000040, A002496, A056892-A056898.
%K A056896 nonn,changed
%O A056896 1,1
%A A056896 _Henry Bottomley_, Jul 05 2000
%E A056896 Example corrected by _Harvey P. Dale_, Apr 01 2011