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 A114298 #2 Nov 10 2007 03:00:00 %S A114298 1,1,1,1,2,5,13,34,110,393,1449,5390,21534,90418,389265,1694769, %T A114298 7593330,34910142,163314286,772044618,3702870682,18017064221, %U A114298 88689351909,440271808570,2205020557614,11141413883818,56737939027682 %N A114298 First row of Modified Schroeder numbers for q=7 (A114294). %C A114298 a(i) is the number of paths from (0,0) to (i,i) using steps of length (0,1), (1,0) and (1,1), not passing above the line y=x nor below the line y=3x/4. %D A114298 C. Hanusa (2005). A Gessel-Viennot-Type Method for Cycle Systems with Applications to Aztec Pillows. PhD Thesis. University of Washington, Seattle, USA. %e A114298 The number of paths from (0,0) to (5,5) staying between the lines y=x and y=3x/4 using steps of length (0,1), (1,0) and (1,1) is a(5)=5. %Y A114298 See also A112833-A112844 and A114292-A114299. %K A114298 nonn %O A114298 0,5 %A A114298 Christopher Hanusa (chanusa(AT)math.binghamton.edu), Nov 21 2005