%I #15 Feb 09 2019 07:25:01
%S 1,1,1,1,3,1,1,0,0,1,1,2,3,2,1,1,4,0,0,4,1,1,1,1,3,1,1,1,1,3,1,4,4,1,
%T 3,1,1,0,0,1,1,1,0,0,1,1,2,3,2,1,1,2,3,2,1,1,4,0,0,4,3,4,0,0,4,1,1,1,
%U 1,3,1,3,3,1,3,1,1,1,1,3,1,4,4,3,4,3,4,4,1,3,1
%N Square array of Delannoy numbers D(i,j) mod 5 (i >= 0, j >= 0) read by antidiagonals.
%H Marko Razpet, <a href="http://dx.doi.org/10.1016/S0012-365X(01)00098-X">A self-similarity structure generated by king's walk</a>, Algebraic and topological methods in graph theory (Lake Bled, 1999). Discrete Math. 244 (2002), no. 1-3, 423--433. MR1844050 (2002k:05022).
%H Rémy Sigrist, <a href="/A211313/a211313.png">Colored representation of the first 1000 rows</a>
%e Written as a triangle:
%e 1,
%e 1, 1,
%e 1, 3, 1,
%e 1, 0, 0, 1,
%e 1, 2, 3, 2, 1,
%e 1, 4, 0, 0, 4, 1,
%e 1, 1, 1, 3, 1, 1, 1,
%e 1, 3, 1, 4, 4, 1, 3, 1,
%e 1, 0, 0, 1, 1, 1, 0, 0, 1,
%e ...
%Y Cf. A008288, A211312, A211314, A211315.
%K nonn,tabl
%O 0,5
%A _N. J. A. Sloane_, Apr 15 2012