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 A048511 #16 Sep 08 2022 08:44:57 %S A048511 1,50,163,421,1005,2317,5245,11741,26077,57565,126429,276445,602077, %T A048511 1306589,2826205,6094813,13107165,28114909,60162013,128450525, %U A048511 273678301,581959645,1235222493,2617245661,5536481245,11693719517 %N A048511 a(n) = T(6,n), array T given by A048505. %C A048511 n-th difference of a(n), a(n-1), ..., a(0) is (49, 64, 81, 100, ...). %H A048511 Vincenzo Librandi, <a href="/A048511/b048511.txt">Table of n, a(n) for n = 0..2000</a> %H A048511 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (7,-18,20,-8). %F A048511 a(n) = (n+9)*(n+16) * 2^(n-2) - 35. - _Ralf Stephan_, Feb 05 2004 %F A048511 a(n) = 7*a(n-1)-18*a(n-2)+20*a(n-3)-8*a(n-4). - _Colin Barker_, Feb 25 2015 %F A048511 G.f.: (160*x^3-169*x^2+43*x+1) / ((x-1)*(2*x-1)^3). - _Colin Barker_, Feb 25 2015 %o A048511 (Magma) [(n+9)*(n+16) * 2^(n-2) - 35: n in [0..30]]; // _Vincenzo Librandi_, Sep 26 2011 %o A048511 (PARI) Vec((160*x^3-169*x^2+43*x+1) / ((x-1)*(2*x-1)^3) + O(x^100)) \\ _Colin Barker_, Feb 25 2015 %K A048511 nonn,easy %O A048511 0,2 %A A048511 _Clark Kimberling_