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 A095090 #10 Jul 20 2020 06:41:02
%S A095090 1,1,2,3,6,9,17,33,60,108,202,360,703,1328,2519,4779,9103,17501,33473,
%T A095090 64761
%N A095090 Number of 4k+3 integers in range ]2^n,2^(n+1)] whose Jacobi-vector is a Motzkin-path (A095100).
%H A095090 A. Karttunen and J. Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>
%F A095090 a(n) = 2^(n-2) - A095091(n) for n > 1.
%o A095090 (PARI) is(m) = {my(s=0); for(i=1, m-1, if((s+=kronecker(i, m))<0, return(0))); 1; }
%o A095090 a(n) = {my(c=0); forstep(m=2^n+3-(n==1), 2^(n+1), 4, c+=is(m)); c; } \\ _Jinyuan Wang_, Jul 20 2020
%Y A095090 Cf. A095092, A095100.
%K A095090 nonn,more
%O A095090 1,3
%A A095090 _Antti Karttunen_ and Jun 01 2004