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 A036605 #19 Jul 08 2025 21:48:18
%S A036605 1,4,4,7,13,19,31,52,82,133,217,349,565,916,1480,2395,3877,6271,10147,
%T A036605 16420,26566,42985,69553,112537,182089,294628,476716,771343,1248061,
%U A036605 2019403,3267463,5286868,8554330,13841197,22395529,36236725
%N A036605 a(n) = a(n-2) + 2*a(n-3) + a(n-4).
%D A036605 D. E. Knuth, Art of Computer Programming, Vol. 3, Sect. 5.4.2, Eq. (25).
%H A036605 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (0,1,2,1).
%F A036605 3 * [Fibonacci(n+2)/2] + 1. - _Ralf Stephan_, Dec 02 2004
%F A036605 a(n) = (A099837(n+2)+A022086(n+2))/2. G.f. ( -1-4*x-3*x^2-x^3 ) / ( (1+x+x^2)*(x^2+x-1) ). - _R. J. Mathar_, Mar 21 2011
%p A036605 A036605 := proc(n) option remember; if n <= 0 then 1 else A036605(n-2)+2*A036605(n-3)+A036605(n-4); fi; end;
%t A036605 LinearRecurrence[{0, 1, 2, 1}, {1, 4, 4, 7}, 36] (* _Jean-François Alcover_, Apr 01 2020 *)
%Y A036605 Cf. A004695.
%K A036605 nonn,easy
%O A036605 0,2
%A A036605 _N. J. A. Sloane_