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 A022382 #43 Jun 15 2022 01:53:00
%S A022382 4,10,14,24,38,62,100,162,262,424,686,1110,1796,2906,4702,7608,12310,
%T A022382 19918,32228,52146,84374,136520,220894,357414,578308,935722,1514030,
%U A022382 2449752,3963782,6413534,10377316,16790850,27168166,43959016,71127182,115086198,186213380
%N A022382 Fibonacci sequence beginning 4, 10.
%C A022382 From _Reeva Bohra_ and _Greg Dresden_, Aug 17 2021: (Start)
%C A022382 For n > 0, a(n) is the number of ways to tile, with squares and dominoes, a strip of length n+1 that begins with two vertical strips of heights 3 and 2. As an example, a(5) is the number of ways to tile this figure (of length 6) with squares and dominoes.
%C A022382 ._
%C A022382 |_|_
%C A022382 |_|_|_______
%C A022382 |_|_|_|_|_|_|
%C A022382 (End)
%H A022382 Michael De Vlieger, <a href="/A022382/b022382.txt">Table of n, a(n) for n = 0..4781</a>
%H A022382 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022382 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1,1).
%F A022382 G.f.: (4+6x)/(1-x-x^2). - _Philippe Deléham_, Nov 19 2008
%F A022382 a(n) = 2*A001060(n). - _R. J. Mathar_, Mar 11 2011
%F A022382 a(n) = Fibonacci(n+5) + Lucas(n-1). - _Greg Dresden_, Feb 18 2022
%F A022382 a(n) = a(n-1) + a(n-2). - _Wesley Ivan Hurt_, Mar 08 2022
%t A022382 LinearRecurrence[{1, 1}, {4, 10}, 50] (* _Greg Dresden_, Aug 17 2021 *)
%Y A022382 Cf. A001060, A022124.
%K A022382 nonn
%O A022382 0,1
%A A022382 _N. J. A. Sloane_