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 A098808 #22 May 29 2019 13:12:29
%S A098808 2037,4085,8181,16373,32757,65525,131061,262133,524277,1048565,
%T A098808 2097141,4194293,8388597,16777205,33554421,67108853,134217717,
%U A098808 268435445,536870901,1073741813,2147483637,4294967285,8589934581,17179869173
%N A098808 a(n) = 2^(n + 11) - 11.
%H A098808 T. Skolem, S. Chowla and D. J. Lewis, <a href="https://doi.org/10.1090/S0002-9939-1959-0109137-4">The diophantine equation 2^(n+2) - 7 = x^2 and related problems</a>, Proc. Amer. Math. Soc., 10 (1959), 663-669.
%H A098808 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2).
%F A098808 From _Colin Barker_, May 11 2012: (Start)
%F A098808 a(n) = 3*a(n-1)-2*a(n-2).
%F A098808 G.f.: (2037-2026*x)/((1-x)*(1-2*x)). (End)
%e A098808 a(0) = 2^11 - 11 = 2037.
%e A098808 a(1) = 2^12 - 11 = 4085.
%t A098808 Table[2^(n + 11) - 11, {n, 0, 30}] (* _Stefan Steinerberger_, Mar 06 2006 *)
%o A098808 (PARI) first(m)=vector(m,i,i--;2^(i + 11) - 11) \\ _Anders Hellström_, Aug 26 2015
%Y A098808 Cf. A038198, A060728.
%K A098808 nonn,easy
%O A098808 0,1
%A A098808 _Parthasarathy Nambi_, Oct 06 2004
%E A098808 More terms from _Stefan Steinerberger_, Mar 06 2006