login
Triangle read by rows in which T(n,k) is half the number of n-bit words with maximum overlap k, n >= 1, k >= 0.
1

%I #18 Jun 24 2021 21:34:34

%S 1,1,1,2,1,1,3,3,1,1,6,5,3,1,1,10,11,6,3,1,1,20,19,14,6,3,1,1,37,41,

%T 24,15,6,3,1,1,74,77,53,26,15,6,3,1,1,142,159,99,59,27,15,6,3,1,1,284,

%U 307,207,111,62,27,15,6,3,1,1,558,625,400,232,117,63

%N Triangle read by rows in which T(n,k) is half the number of n-bit words with maximum overlap k, n >= 1, k >= 0.

%H H. Harborth, <a href="http://www.digizeitschriften.de/dms/img/?PID=GDZPPN002189852">Endliche 0-1-Folgen mit gleichen Teilblöcken</a>, J. für Reine Angewandte Math. 271 (1974), 139-154.

%F T(n,k) = A345530(n,k)/2.

%e Triangle begins:

%e 1;

%e 1, 1;

%e 2, 1, 1;

%e 3, 3, 1, 1;

%e 6, 5, 3, 1, 1;

%e 10, 11, 6, 3, 1, 1;

%e ...

%Y Cf. A345530 (main entry).

%K nonn,tabl

%O 1,4

%A _Sean A. Irvine_, Jun 24 2021