A367631Triangle read by rows: T(n,k) is the number of permutations of length n avoiding simultaneously the patterns 123 and 132 with the maximum number of non-overlapping descents equal k.
1, 1, 0, 1, 1, 0, 0, 4, 0, 0, 0, 5, 3, 0, 0, 0, …
The first 6 terms appear at position 3,844.
1415926535897932384626433…
…40628620899862803482534211706798214808651328230664…
…848111745028410270193852110555964462294895493038196…
…9695362314429524849371871101457654035902799344037420…
…92112019130203303801976211011004492932151608424448596…
…921120191302033038019762110110044929321516084244485963…
…9211201913020330380197621101100449293215160842444859637…
…92112019130203303801976211011004492932151608424448596376…
| terms | string | first position | occurrences |
|---|---|---|---|
| 1 | 1 | 1 | 99,997,334 |
| 2 | 11 | 94 | 9,997,964 |
| 3 | 110 | 174 | 999,458 |
| 4 | 1101 | 2,779 | 100,706 |
| 5 | 11011 | 3,844 | 10,150 |
| 6 | 110110 | 3,844 | 995 |
| 7 | 1101100 | 3,844 | 102 |
| 8 | 11011004 | 3,844 | 6 |
| 9 | 110110040 | not within 1,000,000,000 | 0 |
| 10 | 1101100400 | not within 1,000,000,000 | 0 |
| 11 | 11011004000 | not within 1,000,000,000 | 0 |
| 12 | 110110040005 | not within 1,000,000,000 | 0 |
Searched the first 1,000,000,000 digits. Strings longer than 12 digits are not indexed.