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 A198275 #32 Feb 06 2025 10:38:34
%S A198275 16,33,67,135,271,543,1087,2175,4351,8703,17407,34815,69631,139263,
%T A198275 278527,557055,1114111,2228223,4456447,8912895,17825791,35651583,
%U A198275 71303167,142606335,285212671,570425343,1140850687,2281701375,4563402751,9126805503,18253611007
%N A198275 a(n) = 17*2^n - 1.
%H A198275 Vincenzo Librandi, <a href="/A198275/b198275.txt">Table of n, a(n) for n = 0..1000</a>
%H A198275 Gennady Eremin, <a href="https://arxiv.org/abs/2405.16143">Partitioning the set of natural numbers into Mersenne trees and into arithmetic progressions; Natural Matrix and Linnik's constant</a>, arXiv:2405.16143 [math.CO], 2024. See pp. 3, 14.
%H A198275 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2).
%F A198275 a(n+1) = 2*a(n) + 1.
%F A198275 G.f.: ( 16-15*x ) / ( (2*x-1)*(x-1) ). - _R. J. Mathar_, Oct 25 2011
%F A198275 a(0)=16, a(1)=33, a(n)=3*a(n-1)-2*a(n-2). - _Harvey P. Dale_, Dec 03 2011
%F A198275 a(n) + a(n-1)^2 = (a(n-1)+1)^2. - _Vincenzo Librandi_, Jun 11 2014
%e A198275 a(2) = 17*2^2-1 = 67.
%p A198275 A198275:=n->17*2^n-1; seq(A198275(n), n=0..30); # _Wesley Ivan Hurt_, Jun 11 2014
%t A198275 17*2^Range[0,30]-1 (* or *) LinearRecurrence[{3,-2},{16,33},40] (* _Harvey P. Dale_, Dec 03 2011 *)
%o A198275 (BASIC) for j = 0 to 30 : print str$((17*2^j)-1)+", "; : next j
%o A198275 (Magma) [17*2^n-1: n in [0..30]]; // _Vincenzo Librandi_, Oct 28 2011
%Y A198275 Cf. A086224, A110287.
%K A198275 nonn,easy
%O A198275 0,1
%A A198275 _Jeremy Gardiner_, Oct 23 2011