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 A317976 #10 Sep 09 2018 06:44:02 %S A317976 0,0,1,0,2,6,15,46,132,380,1101,3180,9190,26562,76763,221850,641160, %T A317976 1852984,5355225,15476888,44729034,129269310,373595239,1079710278, %U A317976 3120420620,9018182964,26063032485,75323561860,217689133998,629133273722,1818228906675,5254779066930,15186593360656,43890069394800,126844654738097 %N A317976 a(n) = 2*(a(n-1)+a(n-2)+a(n-3))-a(n-4) for n >= 4, with initial terms 0,0,1,0. %H A317976 Colin Barker, <a href="/A317976/b317976.txt">Table of n, a(n) for n = 0..1000</a> %H A317976 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (2,2,2,-1). %F A317976 G.f.: x^2*(1 - 2*x) / (1 - 2*x - 2*x^2 - 2*x^3 + x^4). - _Colin Barker_, Sep 09 2018 %t A317976 (See A192235.) %o A317976 (PARI) concat(vector(2), Vec(x^2*(1 - 2*x) / (1 - 2*x - 2*x^2 - 2*x^3 + x^4) + O(x^40))) \\ _Colin Barker_, Sep 09 2018 %Y A317976 Other sequences with this recurrence but different initial conditions: A192234, A192237, A317973, A317974, A317975. %K A317976 nonn,easy %O A317976 0,5 %A A317976 _N. J. A. Sloane_, Sep 03 2018