|
Search: id:A103139
|
|
|
| A103139 |
|
Woolbright sequence: the maximum number of kings on an n X n chess board such that every single king is attacking a number of other kings that is smaller or equal to the number of empty spaces arround it. |
|
+0
2
|
|
| 1, 2, 6, 9, 15, 22, 28, 39, 49, 59, 73
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Lower bounds foe terms following 59 are as follows: 73, 86, 102, 117, 136, 153, 173, 195, 216, 239, 266, 289, 318, 345, 375, 405, 438, 471, 504, 540, 576, 614, 654, 693, 735, 777, ...
|
|
REFERENCES
|
J. E. Dunbar, D. G. Hoffman, R. C. Laskar and L. R. Markus, Alpha-domination, Discrete Mathematics, 211 (2000), pp. 11-26.
Eugen J. Ionascu, Dan Pritikin and Stephen E. Wright, k-Dependence and Domination in Kings Graphs, Amer. Math. Monthly, 115 (2008), 820-836.
|
|
LINKS
|
Eugen J. Ionascu, Dan Pritikin and Stephen E. Wright, k-Dependence and Domination in Kings Graphs [From Vladeta Jovovic (vladeta(AT)eunet.yu), Sep 17 2008]
|
|
FORMULA
|
a(n)=n^2-gamma_{1/2}(n)= approx floor(3*(n^2+1)/5) (I assume this is a lower bound? - N. J. A. Sloane (njas(AT)research.att.com))
|
|
EXAMPLE
|
a(3)=6. Indeed, on a 3 X 3 chess board one can arrange six kings on two sides columns to satisfy the requirement. It is not possible to arrange seven kings since the center has to be empty and then at least one of the squares in the middle of the sides must have a king on it which requires at least three empty spaces around and that is impossible.
|
|
CROSSREFS
|
Sequence in context: A120387 A084265 A084140 this_sequence A049622 A043548 A054974
Adjacent sequences: A103136 A103137 A103138 this_sequence A103140 A103141 A103142
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Eugen J. Ionascu (ionascu_eugen(AT)colstate.edu), Mar 17 2005
|
|
EXTENSIONS
|
One more term [from the Ionascu et al. paper] from Vladeta Jovovic (vladeta(AT)eunet.yu), Sep 17 2008
|
|
|
Search completed in 0.002 seconds
|
