%I M3223
%S 0,0,1,1,4,4,4,4,5,5,5,5,5,5,5,5,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,9,9,
%T 9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,10,10,10,
%U 10,10,10,10,10,10,10
%N Diagonal length function.
%D Edward M. Reingold and Xiao Jun Shen, More nearly optimal algorithms for unbounded searching. I. The finite case, SIAM J. Comput. 20 (1991), no. 1, 156183.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%K nonn
%O 0,5
%A _N. J. A. Sloane_.
