|
|
A063712
|
|
Table of bits required for product of n- and k-bit positive numbers read by antidiagonals.
|
|
1
|
|
|
1, 2, 2, 3, 4, 3, 4, 5, 5, 4, 5, 6, 6, 6, 5, 6, 7, 7, 7, 7, 6, 7, 8, 8, 8, 8, 8, 7, 8, 9, 9, 9, 9, 9, 9, 8, 9, 10, 10, 10, 10, 10, 10, 10, 9, 10, 11, 11, 11, 11, 11, 11, 11, 11, 10, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 13, 14, 14
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This sequence is A063711 without zeros.
The first entry is a(1,1) which (arbitrarily) is considered to have offset 1.
a(n, k) is also the maximal number of rooks that can be placed on an n X k chessboard so that each rook is attacked by at most (equivalently, exactly) two others. (If more than two rooks lie in a given row or column, each rook attacks only its nearest neighbors. That is, rooks don't jump.) - Joel B. Lewis, Oct 17 2008
|
|
LINKS
|
|
|
FORMULA
|
a(n, k) = n*k if min(n, k) = 1, n+k otherwise.
|
|
EXAMPLE
|
Table begins
1, 2, 3, 4, 5, 6, 7, ...
2, 4, 5, 6, 7, 8, 9, ...
3, 5, 6, 7, 8, 9, 10, ...
4, 6, 7, 8, 9, 10, 11, ...
5, 7, 8, 9, 10, 11, 12, ...
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
Frank Seaton Taylor (ftaylor(AT)cse.ogi.edu), Aug 09 2001
|
|
STATUS
|
approved
|
|
|
|