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 A243836 #9 Jan 24 2019 17:13:29 %S A243836 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, %T A243836 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16796, %U A243836 0,0,0,0,0,0,0,0,0,0,16796,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,55,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1210,0,0,0,0,0,0,0,0,0,0,0,0,0,0,66,15730,0,0 %N A243836 Number A(n,k) of Dyck paths of semilength n having exactly ten (possibly overlapping) occurrences of the consecutive step pattern given by the binary expansion of k, where 1=U=(1,1) and 0=D=(1,-1); square array A(n,k), n>=0, k>=0, read by antidiagonals. %H A243836 Alois P. Heinz, <a href="/A243836/b243836.txt">Antidiagonals n = 0..140, flattened</a> %e A243836 Square array A(n,k) begins: %e A243836 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... %e A243836 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... %e A243836 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... %e A243836 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... %e A243836 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... %e A243836 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... %e A243836 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... %e A243836 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... %e A243836 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... %e A243836 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... %e A243836 16796, 16796, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... %e A243836 0, 0, 55, 1, 0, 1, 0, 0, 0, 0, 1, 0, ... %Y A243836 Main diagonal gives A243779 or column k=10 of A243752. %Y A243836 Cf. A243753, A243827, A243828, A243829, A243830, A243831, A243832, A243833, A243834, A243835. %K A243836 nonn,tabl %O A243836 0,66 %A A243836 _Alois P. Heinz_, Jun 11 2014