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 A226649 #29 Sep 12 2018 18:22:04
%S A226649 0,2,0,3,1,4,2,6,4,9,7,14,12,22,20,35,33,56,54,90,88,145,143,234,232,
%T A226649 378,376,611,609,988,986,1598,1596,2585,2583,4182,4180,6766,6764,
%U A226649 10947,10945,17712,17710,28658,28656,46369,46367,75026,75024,121394,121392,196419,196417,317812,317810
%N A226649 Fibonacci shuffles: a(2n) = A000071(n) and a(2n+1) = A001611(n+2).
%C A226649 a(2*n+1) = a(2*n) + A157725(n); a(2*n) = a(2*n-1) - 2 for n > 0. - _Reinhard Zumkeller_, Jul 30 2013
%H A226649 Reinhard Zumkeller, <a href="/A226649/b226649.txt">Table of n, a(n) for n = 0..10000</a>
%H A226649 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (-1,1,1,1,1).
%F A226649 G.f. -x*(2+x^2+2*x^3+2*x) / ( (1+x)*(x^4+x^2-1) ). - _R. J. Mathar_, Jul 15 2013
%F A226649 a(n) + a(n+1) = A096748(n+2). - _R. J. Mathar_, Jul 15 2013
%F A226649 a(2n-1) - 1 = a(2n) + 1 = fib(n+1) = A000045(n+1) for n > 0. - _T. D. Noe_, Jul 23 2013
%t A226649 LinearRecurrence[{-1,1,1,1,1},{0,2,0,3,1},60] (* _Harvey P. Dale_, Sep 12 2018 *)
%o A226649 (Haskell)
%o A226649 import Data.List (transpose)
%o A226649 a226649 n = a226649_list !! n
%o A226649 a226649_list = concat $ transpose [a000071_list, drop 2 a001611_list]
%o A226649 -- _Reinhard Zumkeller_, Jul 30 2013
%Y A226649 Cf. A000071, A001611, A096748.
%K A226649 nonn,easy
%O A226649 0,2
%A A226649 _V. T. Jayabalaji_, Jun 14 2013