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 A023496 #7 Feb 01 2019 10:24:45
%S A023496 4,7,13,19,29,43,65,101,157,247,392,626,1004,1616,2604,4202,6787,
%T A023496 10969,17735,28682,46394,75052,121421,196448,317842,514261,832073,
%U A023496 1346303,2178344,3524614,5702924,9227503,14930391,24157857,39088210
%N A023496 a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th number that is 1 or is not a Lucas number).
%F A023496 a(n) = A000045(n+4)+A090946(n+1), n>0. - _R. J. Mathar_, Feb 01 2019
%t A023496 Module[{nn=50,fibs,nlucs,len},fibs=Fibonacci[Range[4,nn+4]];nlucs=Join[ {1}, Complement[Range[nn],LucasL[Range[nn/5]]]];len=Min[Length[fibs],Length[nlucs]];Total/@Thread[{Take[fibs,len],Take[nlucs,len]}]] (* _Harvey P. Dale_, Aug 09 2013 *)
%K A023496 nonn
%O A023496 0,1
%A A023496 _Clark Kimberling_