|
Search: id:A030179
|
|
| |
|
| 0, 0, 1, 4, 16, 36, 81, 144, 256, 400, 625, 900, 1296, 1764, 2401, 3136, 4096, 5184, 6561, 8100, 10000, 12100, 14641, 17424, 20736, 24336, 28561, 33124, 38416, 44100, 50625, 57600, 65536, 73984, 83521, 93636, 104976, 116964
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Conjectured to be crossing number of complete bipartite graph K_{n,n}. Known to be true for n <= 7.
|
|
REFERENCES
|
C. Thomassen, Embeddings and minors, pp. 301-349 of R. L. Graham et al., eds., Handbook of Combinatorics, MIT Press.
|
|
LINKS
|
G. Xiao, Contfrac
E. Weisstein, Zarankiewicz's Conjecture.html
|
|
FORMULA
|
Floor(n^2/4)^2.
|
|
CROSSREFS
|
C. A000241, A002620, A014540.
Sequence in context: A063755 A166721 A085040 this_sequence A005722 A075408 A114268
Adjacent sequences: A030176 A030177 A030178 this_sequence A030180 A030181 A030182
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jan 10 2002
|
|
|
Search completed in 0.002 seconds
|
