A006264 Diagonal length function. (Formerly M3223)

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, 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, 10, 10, 10, 10, 10, 10, 10

Offset

0,5

References

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, 156-183.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

Table of n, a(n) for n=0..73.

Crossrefs

Sequence in context: A268237 A276866 A331842 * A134994 A138195 A140744

Adjacent sequences: A006261 A006262 A006263 * A006265 A006266 A006267

Keyword

nonn

Author

N. J. A. Sloane.

Status

approved