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 A036547 #20 Aug 29 2024 22:07:31 %S A036547 1,65,257,833,2561,7745,23297,69953,209921,629825,1889537,5668673, %T A036547 17006081,51018305,153054977,459164993,1377495041,4132485185, %U A036547 12397455617,37192366913,111577100801,334731302465,1004193907457,3012581722433,9037745167361,27113235502145 %N A036547 a(n) = T(6,n), array T given by A048471. %C A036547 n-th difference of a(n), a(n-1), ..., a(0) is 2^(n+5) for n=1, 2, 3, ... %H A036547 Vincenzo Librandi, <a href="/A036547/b036547.txt">Table of n, a(n) for n = 0..1000</a> %H A036547 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (4,-3). %F A036547 a(n) = 32*3^n - 31. - _Ralf Stephan_, Feb 17 2004 %F A036547 From _Vincenzo Librandi_, Nov 11 2011: (Start) %F A036547 a(n) = 3*a(n-1) + 62. %F A036547 a(n) = 4*a(n-1) - 3*a(n-2). %F A036547 G.f.: (1+61*x)/((1-x)*(1-3*x)). (End) %F A036547 E.g.f.: exp(x)*(32*exp(2*x) - 31). - _Elmo R. Oliveira_, Aug 29 2024 %o A036547 (Magma) [32*3^n-31: n in [0..30]]; // _Vincenzo Librandi_, Nov 11 2011 %Y A036547 Cf. A048471. %K A036547 nonn,easy %O A036547 0,2 %A A036547 _Clark Kimberling_