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 A036564 #72 Dec 03 2023 18:21:32
%S A036564 1,19,83,211,467,979,2003,4051,8147,16339,32723,65491,131027,262099,
%T A036564 524243,1048531,2097107,4194259,8388563,16777171,33554387,67108819,
%U A036564 134217683,268435411,536870867,1073741779,2147483603,4294967251
%N A036564 a(n) = 2^n - 45 with n>5, a(5)=1.
%H A036564 Vincenzo Librandi, <a href="/A036564/b036564.txt">Table of n, a(n) for n = 5..1000</a>
%H A036564 Robert Sedgewick, <a href="https://sedgewick.io/wp-content/themes/sedgewick/papers/1996Shellsort.pdf">Analysis of shellsort and related algorithms</a>, Fourth European Symposium on Algorithms, Barcelona, September, 1996.
%H A036564 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2).
%H A036564 <a href="/index/So#sorting">Index entries for sequences related to sorting</a>
%F A036564 G.f.: x^5*(1+2*x)*(1+14*x)/((1-x)*(1-2*x)). [_Colin Barker_, Mar 09 2012]
%t A036564 A036564[n_]:=If[n>5,2^n-45,1];Array[A036564,50,5] (* or *)
%t A036564 LinearRecurrence[{3,-2},{1,19,83},50] (* _Paolo Xausa_, Dec 03 2023 *)
%o A036564 (PARI) a(n)=if(n>5,2^n-45,1) \\ _Charles R Greathouse IV_, Mar 10 2012
%o A036564 (Python)
%o A036564 def a(n): return pow(2, n)-45 if n!= 5 else 1
%o A036564 for n in range(5, 100): print(a(n), end=', ') # _Javier Rivera Romeu_, Mar 04 2022
%Y A036564 Sequences used for Shell sort: this sequence, A003462, A033622, A036562, A036569, A055875.
%K A036564 nonn,easy
%O A036564 5,2
%A A036564 _N. J. A. Sloane_