This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 0
 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 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS 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: A217536 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 14 07:03 EST 2019. Contains 329978 sequences. (Running on oeis4.)