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 A198949 #25 Aug 01 2015 09:52:00
%S A198949 1,23,43,461,859,9197,17137,183479,341881,3660383,6820483,73024181,
%T A198949 136067779,1456823237,2714535097,29063440559,54154634161,579811987943,
%U A198949 1080378148123,11567176318301,21553408328299,230763714378077,429987788417857,4603707111243239
%N A198949 y-values in the solution to 11*x^2-10 = y^2.
%C A198949 When are both n+1 and 11*n+1 perfect squares? This problem gives the equation 11*x^2-10 = y^2.
%H A198949 Vincenzo Librandi, <a href="/A198949/b198949.txt">Table of n, a(n) for n = 1..250</a>
%H A198949 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (0, 20, 0, -1).
%F A198949 a(n+4) = 20*a(n+2)-a(n) with a(1)=1, a(2)=23, a(3)=43, a(4)=461.
%F A198949 G.f.: x*(1+x)*(1+22*x+x^2)/(1-20*x^2+x^4). - _Bruno Berselli_, Nov 04 2011
%F A198949 a(n) = ((-(-1)^n-t)*(10-3*t)^floor(n/2)+(-(-1)^n+t)*(10+3*t)^floor(n/2))/2 where t=sqrt(11). - _Bruno Berselli_, Nov 14 2011
%t A198949 LinearRecurrence[{0, 20, 0, -1}, {1,23,43,461}, 24] (* _Bruno Berselli_, Nov 11 2011 *)
%o A198949 (Maxima) makelist(expand(((-(-1)^n-sqrt(11))*(10-3*sqrt(11))^floor(n/2)+(-(-1)^n+sqrt(11))*(10+3*sqrt(11))^floor(n/2))/2), n, 1, 24); /* _Bruno Berselli_, Nov 14 2011 */
%Y A198949 Cf. A198947.
%K A198949 nonn,easy
%O A198949 1,2
%A A198949 _Sture Sjöstedt_, Oct 31 2011
%E A198949 More terms from _Bruno Berselli_, Nov 04 2011