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 A215814 #70 Feb 10 2025 04:41:29
%S A215814 2481403,2480911,2601451,2843023,3205627,3689263,4293931,5019631,
%T A215814 5866363,6834127,7922923,9132751,10463611,11915503,13488427,15182383,
%U A215814 16997371,18933391,20990443,23168527,25467643,27887791,30428971,33091183,35874427,38778703,41804011,44950351
%N A215814 a(n) = 60516*n^2 - 61008*n + 2481403.
%C A215814 The formula gives consecutive primes for n from 1 to 20, except n = 9.
%C A215814 This is the case m = 41*6 = 246 and k = 41 of the polynomial m^2*n^2 + (m^2 - 2*m)*n + (m^2*k) - (m-1).
%H A215814 Vincenzo Librandi, <a href="/A215814/b215814.txt">Table of n, a(n) for n = 0..1000</a>
%H A215814 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F A215814 G.f.: (2481403 - 4963298*x + 2602927*x^2)/(1-x)^3. - _Bruno Berselli_, Aug 28 2012
%F A215814 From _Elmo R. Oliveira_, Feb 09 2025: (Start)
%F A215814 E.g.f.: exp(x)*(2481403 - 492*x + 60516*x^2).
%F A215814 a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2. (End)
%p A215814 A215814:=n->60516*n^2 - 61008*n + 2481403; seq(A215814(n), n=0..100); # _Wesley Ivan Hurt_, Nov 28 2013
%t A215814 Table[60516 n^2 - 61008 n + 2481403, {n, 0, 30}] (* _Vincenzo Librandi_, Aug 29 2012 *)
%o A215814 (Magma) [60516*n^2-61008*n+2481403: n in [0..26]]; // _Bruno Berselli_, Aug 28 2012
%o A215814 (PARI) a(n)=60516*n^2-61008*n+2481403 \\ _Charles R Greathouse IV_, Jun 17 2017
%Y A215814 Cf. A214732.
%K A215814 nonn,easy
%O A215814 0,1
%A A215814 _Robert Potter_, Aug 28 2012
%E A215814 Offset changed from 1 to 0 and a(0) added from _Vincenzo Librandi_, Aug 29 2012
%E A215814 Gf adapted to the offset by _Bruno Berselli_, Aug 29 2012