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 A168373 #19 Sep 08 2022 08:45:49 %S A168373 4,4,11,11,18,18,25,25,32,32,39,39,46,46,53,53,60,60,67,67,74,74,81, %T A168373 81,88,88,95,95,102,102,109,109,116,116,123,123,130,130,137,137,144, %U A168373 144,151,151,158,158,165,165,172,172,179,179,186,186,193,193,200,200,207 %N A168373 a(n) = 7*n - a(n-1) - 6 with n>1, a(1)=4. %H A168373 Vincenzo Librandi, <a href="/A168373/b168373.txt">Table of n, a(n) for n = 1..1000</a> %H A168373 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,-1). %F A168373 a(n) = A168212(n-1), n>1. - _R. J. Mathar_, Nov 25 2009 %F A168373 From _G. C. Greubel_, Jul 19 2016: (Start) %F A168373 a(n) = (14*n - 7 (-1)^n - 5)/4. %F A168373 a(n) = a(n-1) + a(n-2) - a(n-3). %F A168373 G.f.: x*(4 + 3*x^2)/((1+x)*(1 - x)^2). %F A168373 E.g.f.: (1/4)*(-7 + 12*exp(x) + (14*x - 5)*exp(2*x))*exp(-x). (End) %t A168373 LinearRecurrence[{1, 1, -1}, {4, 4, 11}, 60] (* _Vincenzo Librandi_, Feb 28 2012 *) %o A168373 (Magma) I:=[4, 4, 11]; [n le 3 select I[n] else Self(n-1)+Self(n-2)-Self(n-3): n in [1..60]]; // _Vincenzo Librandi_, Feb 28 2012 %o A168373 (PARI) a(n)=([0,1,0; 0,0,1; -1,1,1]^(n-1)*[4;4;11])[1,1] \\ _Charles R Greathouse IV_, Jul 19 2016 %K A168373 nonn,easy %O A168373 1,1 %A A168373 _Vincenzo Librandi_, Nov 24 2009