Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006264
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006264 Diagonal length function.
(Formerly M3223)
+0
1
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 (list; graph; listen)
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).

CROSSREFS

Sequence in context: A048760 A035627 A165923 this_sequence A134994 A138195 A140744

Adjacent sequences: A006261 A006262 A006263 this_sequence A006265 A006266 A006267

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research