cp's OEIS Frontend

A114929 Array read by antidiagonals: consider a semi-infinite chessboard with squares labeled (i,j), i >= 0, j >= 0; T(i,j) = number of king-paths of length max{i,j} from (0,0) to (i,j).

%I A114929 #11 Mar 05 2016 14:21:08
%S A114929 1,1,1,2,1,2,4,2,2,4,9,5,1,5,9,21,12,3,3,12,21,51,30,9,1,9,30,51,127,
%T A114929 76,25,4,4,25,76,127,323,196,69,14,1,14,69,196,323,835,512,189,44,5,5,
%U A114929 44,189,512,835,2188,1353,518,133,20,1,20,133,518,1353,2188,5798,3610,1422
%N A114929 Array read by antidiagonals: consider a semi-infinite chessboard with squares labeled (i,j), i >= 0, j >= 0; T(i,j) = number of king-paths of length max{i,j} from (0,0) to (i,j).
%D A114929 Harrie Grondijs, Neverending Quest of Type C, Volume B - the endgame study-as-struggle.
%F A114929 Equals Motzkin triangle (A026300) next to same triangle reflected in mirror. See A026300 for the obvious recurrence.
%e A114929 Array begins:
%e A114929 1 1 2 4 9 21 51 ...
%e A114929 1 1 2 5 12 30 ...
%e A114929 2 2 1 3 9 25 ...
%e A114929 4 5 3 1 4 14 ...
%e A114929 ...
%Y A114929 Cf. A026300, A020474, A111808, A114972.
%K A114929 nonn,tabl,easy
%O A114929 0,4
%A A114929 _N. J. A. Sloane_, based on May 27 2005 email from _Harrie Grondijs_, Feb 27 2006
%E A114929 More terms from _Joshua Zucker_, May 20 2006
%E A114929 T(0,0) corrected by _Johannes W. Meijer_, Oct 07 2010