%I #7 Jan 30 2019 06:21:57

%S 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,

%T 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,

%U 0,0,10,11,11,11,11,11,11,11,11,10,0,0,11,12,12,12,12,12,12,12,12

%N Table of bits required for product of n- and k-bit nonnegative numbers read by antidiagonals.

%C Zero is considered to have zero bits.

%C The first entry is a(0,0) which (arbitrarily) is considered to have offset 0.

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

%e Table begins

%e 0 0 0 0 0 0 0 ...

%e 0 1 2 3 4 5 6 ...

%e 0 2 4 5 6 7 8 ...

%e 0 3 5 6 7 8 9 ...

%e 0 4 6 7 8 9 10 ...

%Y Cf. A063712.

%Y Initial rows are A000004 and A001477.

%K nonn,easy,tabl

%O 0,8

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