%I A057790
%S A057790 1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,2,2,1,1,1,1,3,2,3,1,1,1,1,3,4,4,3,1,
%T A057790 1,1,1,5,5,6,5,5,1,1,1,1,6,7,10,10,7,6,1,1,1,1,8,11,16,14,16,11,8,1,1,
               1,
%U A057790 1,12,17,22,27,27,22,17,12,1,1,1,1,18,23,39,44,44,44,39,23,18,1,1,1,1
%N A057790 Triangle read by rows: T(n,k) = number of knight's walks (n >= 0, k >
               = 0).
%D A057790 M. Bousquet-Melou and M. Petkovsek, Linear recurrences with constant 
               coefficients: the multivariate case, Discrete Math., 225 (2000), 
               51-75.
%H A057790 M. Bousquet-M\'{e}lou, <a href="http://www.labri.fr/Perso/~bousquet/Articles/
               Linrec/linrec.ps.gz">Linear recurrences with constant coefficients: 
               the multivariate case</a>
%H A057790 M. Bousquet-M\'elou and M. Petkovsek, <a href="http://arXiv.org/abs/math.CO/
               0211432">Walks confined in a quadrant are not always D-finite</a>
%e A057790 1; 1,1; 1,1,1; 1,1,1,1; 1,1,2,1,1; ...
%p A057790 T:=proc(n,k) if n=0 or n=1 or k=0 or k=1 then 1 else T(n+1,k-2)+T(n-2,
               k+1) fi end: seq(seq(T(n,s-n),n=0..s),s=0..15);
%Y A057790 Sequence in context: A155050 A140356 A119963 this_sequence A052307 A067059 
               A049704
%Y A057790 Adjacent sequences: A057787 A057788 A057789 this_sequence A057791 A057792 
               A057793
%K A057790 nonn,tabl,easy,nice
%O A057790 0,13
%A A057790 N. J. A. Sloane (njas(AT)research.att.com), Nov 05 2000
%E A057790 More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), May 23 2004