cp's OEIS Frontend

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

%I A114972 #8 Mar 31 2012 20:35:52
%S A114972 1,1,1,3,1,3,7,2,2,7,19,6,1,6,19,51,16,3,3,16,51,141,45,10,1,10,45,
%T A114972 141,393,126,30,4,4,30,126,393,1107,357,90,15,1,15,90,357,1107,3139,
%U A114972 1016,266,50,5,5,50,266,1016,3139,8953,2907,784,161,21,1,21,161,784,2907
%N A114972 Array read by antidiagonals: consider a doubly infinite chessboard with squares labeled (i,j), i in Z, j in Z; T(i,j) = number of king-paths of length max{i,j} from (0,0) to (i,j).
%D A114972 Harrie Grondijs, Neverending Quest of Type C, Volume B - the endgame study-as-struggle.
%F A114972 Equals triangle A111808 next to same triangle reflected in mirror. See A111808 for obvious recurrence.
%e A114972 Array begins:
%e A114972 1 1 3 7 19 ...
%e A114972 1 1 2 6 ...
%e A114972 3 2 1 3 ...
%e A114972 7 6 3 1 ...
%e A114972 ...
%Y A114972 Cf. A111808, A026300, A114929.
%K A114972 nonn,tabl,easy
%O A114972 0,4
%A A114972 _N. J. A. Sloane_, based on May 27 2005 email from _Harrie Grondijs_, Feb 27 2006
%E A114972 More terms from _Joshua Zucker_, May 20 2006
%E A114972 T(0,0) corrected by _Johannes W. Meijer_, Oct 05 2010