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 A051040 #24 Feb 16 2025 08:32:41
%S A051040 1,2,4,8,16,32,63,94,125,156,187,218,249,280,311,342,373,404,435,466,
%T A051040 497,528,559,590,621,652,683,714,745,776,807,838,869,900,931,962,993,
%U A051040 1024,1055,1086,1117,1148,1179,1210,1241,1272,1303,1334,1365,1396,1427
%N A051040 5-Stohr sequence.
%H A051040 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/StoehrSequence.html">Stoehr Sequence.</a>
%H A051040 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A051040 Terms are 2^(n-1) up to a(6) and then 31n-154.
%F A051040 a(n) = 31*n-154 for n>5. a(n) = 2*a(n-1)-a(n-2) for n>7. G.f.: x*(15*x^6+8*x^5+4*x^4+2*x^3+x^2+1)/(x-1)^2. - _Colin Barker_, Sep 19 2012
%t A051040 Join[{1,2,4,8,16,32}, Range[63, 2000, 31]] (* _Vladimir Joseph Stephan Orlovsky_, Jun 15 2011 *)
%t A051040 LinearRecurrence[{2,-1},{1,2,4,8,16,32,63},60] (* _Harvey P. Dale_, Sep 14 2015 *)
%o A051040 (PARI) a(n)=if(n>6,31*n-154,2^(n-1)) \\ _Charles R Greathouse IV_, Jun 20 2024
%Y A051040 Cf. A062001, A033627, A026474, A051039.
%K A051040 nonn,easy
%O A051040 1,2
%A A051040 _Eric W. Weisstein_
%E A051040 Corrected by _Henry Bottomley_, May 29 2001