A324150 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.

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, 123, 127, 128, 3, 12, 94, 216, 242, 251, 255, 256, 3, 12, 100, 391, 474, 498, 507, 511, 512, 3, 12, 103, 677, 933, 986, 1010, 1019, 1023, 1024

Offset

1,1

Links

Table of n, a(n) for n=1..55.

Shuo Tan and Jeffrey Shallit, Sets represented as the length-n factors of a word, preprint, arXiv:1304.3666 [cs.FL], 2013.

Example

Triangle begins:
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,123,127,128,
3,12,94,216,242,251,255,256,
3,12,100,391,474,498,507,511,512,
3,12,103,677,933,986,1010,1019,1023,1024,
...

Crossrefs

Sequence in context: A333618 A058267 A048259 * A198461 A228576 A329465

Adjacent sequences: A324147 A324148 A324149 * A324151 A324152 A324153

Keyword

nonn,tabl

Author

N. J. A. Sloane, Feb 26 2019

Status

approved