Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 Dec 29 2014 03:24:34
%S 1,1,1,1,3,1,1,5,5,1,1,0,6,0,1,1,2,4,4,2,1,1,4,6,0,6,4,1,1,6,5,3,3,5,
%T 6,1,1,1,1,0,6,0,1,1,1,1,3,1,6,2,2,6,1,3,1,1,5,5,1,1,3,1,1,5,5,1,1,0,
%U 6,0,1,6,6,1,0,6,0,1,1,2,4,4,2,1,1,1,2,4,4,2,1
%N Square array of Delannoy numbers D(i,j) mod 7 (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).
%e Written as a triangle:
%e 1,
%e 1, 1,
%e 1, 3, 1,
%e 1, 5, 5, 1,
%e 1, 0, 6, 0, 1,
%e 1, 2, 4, 4, 2, 1,
%e 1, 4, 6, 0, 6, 4, 1,
%e 1, 6, 5, 3, 3, 5, 6, 1,
%e 1, 1, 1, 0, 6, 0, 1, 1, 1,
%e ...
%Y Cf. A008288, A211312, A211313, A211315.
%K nonn,tabl
%O 0,5
%A _N. J. A. Sloane_, Apr 15 2012