|
|
A360915
|
|
Array read by antidiagonals: T(m,n) is the length of the longest induced cycle in the grid graph P_m X P_n.
|
|
4
|
|
|
4, 4, 4, 4, 8, 4, 4, 10, 10, 4, 4, 12, 12, 12, 4, 4, 14, 14, 14, 14, 4, 4, 16, 16, 16, 16, 16, 4, 4, 18, 20, 18, 18, 20, 18, 4, 4, 20, 22, 24, 20, 24, 22, 20, 4, 4, 22, 24, 26, 28, 28, 26, 24, 22, 4, 4, 24, 28, 28, 30, 32, 30, 28, 28, 24, 4, 4, 26, 30, 32, 32, 36, 36, 32, 32, 30, 26, 4
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
All terms are even since the grid graph is bipartite.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Grid Graph.
|
|
FORMULA
|
T(m,n) = T(n,m).
|
|
EXAMPLE
|
Array begins:
==========================================
m\n| 2 3 4 5 6 7 8 9 10 11 12 ...
-----+------------------------------------
2 | 4 4 4 4 4 4 4 4 4 4 4 ...
3 | 4 8 10 12 14 16 18 20 22 24 26 ...
4 | 4 10 12 14 16 20 22 24 28 30 32 ...
5 | 4 12 14 16 18 24 26 28 32 36 38 ...
6 | 4 14 16 18 20 28 30 32 36 42 44 ...
7 | 4 16 20 24 28 32 36 40 44 48 52 ...
8 | 4 18 22 26 30 36 40 46 50 56 60 ...
9 | 4 20 24 28 32 40 46 50 56 62 68 ...
10 | 4 22 28 32 36 44 50 56 62 70 74 ...
11 | 4 24 30 36 42 48 56 62 70 76 82 ...
12 | 4 26 32 38 44 52 60 68 74 82 90 ...
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|