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 A198276 #32 Feb 06 2025 10:38:30
%S A198276 18,37,75,151,303,607,1215,2431,4863,9727,19455,38911,77823,155647,
%T A198276 311295,622591,1245183,2490367,4980735,9961471,19922943,39845887,
%U A198276 79691775,159383551,318767103,637534207,1275068415,2550136831,5100273663,10200547327,20401094655
%N A198276 a(n) = 19*2^n-1.
%H A198276 Vincenzo Librandi, <a href="/A198276/b198276.txt">Table of n, a(n) for n = 0..1000</a>
%H A198276 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 A198276 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2).
%F A198276 a(n+1) = 2*a(n) + 1.
%F A198276 G.f.: ( 18-17*x ) / ( (2*x-1)*(x-1) ). - _R. J. Mathar_, Oct 25 2011
%F A198276 a(n) + a(n-1)^2 = (a(n-1)+1)^2. - _Vincenzo Librandi_, Jun 11 2014
%e A198276 a(2) = 19*2^2-1 = 75.
%p A198276 A198276:=n->19*2^n-1; seq(A198276(n), n=0..30); # _Wesley Ivan Hurt_, Jun 11 2014
%t A198276 19*2^Range[0,30]-1 (* or *) LinearRecurrence[{3,-2},{18,37},40] (* _Harvey P. Dale_, Dec 18 2013 *)
%o A198276 (BASIC) for j = 0 to 30 : print str$((19*2^j)-1)+", "; : next j
%o A198276 (Magma) [19*2^n-1: n in [0..30]]; // _Vincenzo Librandi_, Oct 28 2011
%Y A198276 Cf. A086224, A110288.
%K A198276 nonn,easy
%O A198276 0,1
%A A198276 _Jeremy Gardiner_, Oct 23 2011