Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001198
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001198 Zarankiewicz's problem k(n,3).
(Formerly M4601 N1962)
+0
2
9, 14, 21, 27, 34, 43, 50, 61 (list; graph; listen)
OFFSET

3,1

REFERENCES

L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 291.

R. K. Guy, A problem of Zarankiewicz, in P. Erd\"{o}s and G. Katona, editors, Theory of Graphs (Proceedings of the Colloquium, Tihany, Hungary), Academic Press, NY, 1968, pp. 119-150.

R. K. Guy, A many-facetted problem of Zarankiewicz, Lect. Notes Math. 110 (1969), 129-148.

CROSSREFS

Cf. A001197.

Sequence in context: A034703 A006624 A070552 this_sequence A100263 A104812 A093021

Adjacent sequences: A001195 A001196 A001197 this_sequence A001199 A001200 A001201

KEYWORD

nonn

AUTHOR

njas

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research