%I #8 Oct 30 2019 13:25:09
%S 2,3,4,3,7,8,3,11,15,16,3,12,27,31,32,3,12,48,59,63,64,3,12,72,114,
%T 123,127,128,3,12,94,216,242,251,255,256,3,12,100,391,474,498,507,511,
%U 512,3,12,103,677,933,986,1010,1019,1023,1024
%N Triangle read by rows: T(n,k) = number of distinct sets of binary vectors of length k that can be obtained by taking the factors of a word of length n, for 1 <= k <= n.
%H Shuo Tan and Jeffrey Shallit, <a href="http://arxiv.org/abs/1304.3666">Sets represented as the length-n factors of a word</a>, preprint, arXiv:1304.3666 [cs.FL], 2013.
%e Triangle begins:
%e 2,
%e 3,4,
%e 3,7,8,
%e 3,11,15,16,
%e 3,12,27,31,32,
%e 3,12,48,59,63,64,
%e 3,12,72,114,123,127,128,
%e 3,12,94,216,242,251,255,256,
%e 3,12,100,391,474,498,507,511,512,
%e 3,12,103,677,933,986,1010,1019,1023,1024,
%e ...
%K nonn,tabl
%O 1,1
%A _N. J. A. Sloane_, Feb 26 2019