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 A128610 #8 Feb 12 2019 00:40:38
%S A128610 1,1,4,7,14,24,41,69,114,187,305,496,805,1305,2115,3425,5545,8975,
%T A128610 14525,23505,38035,61545,99585,161135,260726,421867,682599,1104472,
%U A128610 1787077,2891555,4678638,7570199,12248843,19819048,32067897,51886951,83954854
%N A128610 a(0)=a(1)=1. For n >= 2, a(n) = a(n-2) + a(n-1) + (number of terms from among {a(0),a(1),a(2),...a(n-1)} which are <= n).
%e A128610 There are 4 terms among the terms {a(0),a(1),a(2),...a(8)} which are <= 9. So a(9) = a(7) + a(8) + 4 = 69 + 114 + 4 = 187.
%p A128610 a[0]:=1:a[1]:=1: for n from 2 to 42 do ct:=2: for j from 2 to n-1 do if a[j]<=n then ct:=ct+1 else fi od: a[n]:=a[n-1]+a[n-2]+ct od: seq(a[n],n=0..42); # _Emeric Deutsch_, May 09 2007
%K A128610 nonn
%O A128610 0,3
%A A128610 _Leroy Quet_, May 08 2007
%E A128610 More terms from _Emeric Deutsch_, May 09 2007