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 A064651 #18 Jul 04 2019 20:07:22
%S A064651 0,1,1,2,2,3,4,5,7,9,12,15,20,25,33,42,54,69,89,114,146,187,240,307,
%T A064651 394,504,646,827,1060,1357,1739,2227,2853,3654,4680,5994,7677,9833,
%U A064651 12594,16130,20659,26460,33889,43405,55592,71201,91193,116798,149592
%N A064651 a(n) = ceiling(a(n-1)/2) + a(n-2) with a(0)=0 and a(1)=1.
%H A064651 Reinhard Zumkeller, <a href="/A064651/b064651.txt">Table of n, a(n) for n = 0..9300</a>
%F A064651 a(n) = A064650(n) - 1.
%F A064651 Lim_{n->infinity} a(n)/a(n-1) = (1+sqrt(17))/4 = 1.2807764... = A188934.
%t A064651 RecurrenceTable[{a[0]==0, a[1]==1, a[n]==Ceiling[a[n-1]/2]+a[n-2]}, a, {n,50}] (* _Harvey P. Dale_, Aug 22 2012 *)
%t A064651 t = {0, 1}; Do[AppendTo[t, Ceiling[t[[-1]]/2] + t[[-2]]], {48}]; t (* _T. D. Noe_, Aug 22 2012 *)
%o A064651 (Haskell)
%o A064651 a064651 n = a064651_list !! n
%o A064651 a064651_list = 0 : 1 : zipWith (+)
%o A064651 a064651_list (map (flip div 2 . (+ 1)) $ tail a064651_list)
%o A064651 -- _Reinhard Zumkeller_, Apr 30 2015
%Y A064651 Cf. A064324, A064325.
%Y A064651 Cf. A064650, A000045, A188934.
%K A064651 nonn
%O A064651 0,4
%A A064651 _Henry Bottomley_, Oct 04 2001