

A063711


Table of bits required for product of n and kbit nonnegative numbers read by antidiagonals.


1



0, 0, 0, 0, 1, 0, 0, 2, 2, 0, 0, 3, 4, 3, 0, 0, 4, 5, 5, 4, 0, 0, 5, 6, 6, 6, 5, 0, 0, 6, 7, 7, 7, 7, 6, 0, 0, 7, 8, 8, 8, 8, 8, 7, 0, 0, 8, 9, 9, 9, 9, 9, 9, 8, 0, 0, 9, 10, 10, 10, 10, 10, 10, 10, 9, 0, 0, 10, 11, 11, 11, 11, 11, 11, 11, 11, 10, 0, 0, 11, 12, 12, 12, 12, 12, 12, 12, 12
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,8


COMMENTS

Zero is considered to have zero bits.
The first entry is a(0,0) which (arbitrarily) is considered to have offset 0.


LINKS

Table of n, a(n) for n=0..87.


FORMULA

a(n, k) = n*k if min(n, k) <= 1, n+k otherwise.


EXAMPLE

Table begins
0 0 0 0 0 0 0 ...
0 1 2 3 4 5 6 ...
0 2 4 5 6 7 8 ...
0 3 5 6 7 8 9 ...
0 4 6 7 8 9 10 ...


CROSSREFS

Cf. A063712.
Initial rows are A000004 and A001477.
Sequence in context: A108036 A190174 A263139 * A057893 A048720 A067138
Adjacent sequences: A063708 A063709 A063710 * A063712 A063713 A063714


KEYWORD

nonn,easy,tabl


AUTHOR

Frank Seaton Taylor (ftaylor(AT)cse.ogi.edu), Thu, Aug 09 2001


STATUS

approved



