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 A048469 #20 Aug 07 2024 06:05:34
%S A048469 1,10,29,69,153,329,697,1465,3065,6393,13305,27641,57337,118777,
%T A048469 245753,507897,1048569,2162681,4456441,9175033,18874361,38797305,
%U A048469 79691769,163577849,335544313,687865849,1409286137,2885681145,5905580025,12079595513,24696061945
%N A048469 a(n) = T(8,n), array T given by A047858.
%C A048469 n-th difference of a(n), a(n-1), ..., a(0) is (9, 10, 11, ...).
%H A048469 Vincenzo Librandi, <a href="/A048469/b048469.txt">Table of n, a(n) for n = 0..3000</a>
%H A048469 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (5,-8,4).
%F A048469 Main diagonal of the array defined by T(0, j) = j+1 for j>=0, T(i, 0) = i+1 for i>=0, T(i, j) = T(i-1, j-1) + T(i-1, j) + 7. - _Benoit Cloitre_, Jun 17 2003
%F A048469 a(n) = 2^(n-1)*(n+16)-7. a(0)=1, a(1)=10, a(2)=29, a(n) = 5*a(n-1)-8*a(n-2)+4*a(n-3). - _Vincenzo Librandi_, Sep 28 2011
%F A048469 G.f.: (1+5*x-13*x^2) / ((1-x)*(1-2*x)^2). - _Colin Barker_, Feb 18 2016
%t A048469 LinearRecurrence[{5,-8,4},{1,10,29},40] (* _Harvey P. Dale_, Aug 15 2020 *)
%o A048469 (Magma) [2^(n-1)*(n+16)-7: n in [0..30]]; // _Vincenzo Librandi_, Sep 28 2011
%K A048469 nonn,easy
%O A048469 0,2
%A A048469 _Clark Kimberling_