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 A051039 #23 Feb 16 2025 08:32:41
%S A051039 1,2,4,8,16,31,46,61,76,91,106,121,136,151,166,181,196,211,226,241,
%T A051039 256,271,286,301,316,331,346,361,376,391,406,421,436,451,466,481,496,
%U A051039 511,526,541,556,571,586,601,616,631,646,661,676,691,706,721,736,751
%N A051039 4-Stohr sequence.
%H A051039 Harvey P. Dale, <a href="/A051039/b051039.txt">Table of n, a(n) for n = 1..1000</a>
%H A051039 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/StoehrSequence.html">Stoehr Sequence.</a>
%H A051039 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A051039 a(n) = 15*n-59 for n>4. a(n) = 2*a(n-1)-a(n-2) for n>6. G.f.: x*(7*x^5+4*x^4+2*x^3+x^2+1)/(x-1)^2. - _Colin Barker_, Sep 19 2012
%t A051039 Join[{1,2,4,8},Range[16,3001,15]] (* _Vladimir Joseph Stephan Orlovsky_, Jan 27 2012 *)
%t A051039 LinearRecurrence[{2,-1},{1,2,4,8,16,31},60] (* _Harvey P. Dale_, Dec 25 2016 *)
%o A051039 (PARI) a(n)=if(n>4,15*n-59,2^(n-1)) \\ _Charles R Greathouse IV_, Jun 20 2024
%Y A051039 Cf. A033627, A026474, A051040.
%K A051039 nonn,easy
%O A051039 1,2
%A A051039 _Eric W. Weisstein_