2018-09-30 22:01:58 +00:00
---
id: 5900f4ab1000cf542c50ffbe
title: 'Problem 319: Bounded Sequences'
2020-11-27 18:02:05 +00:00
challengeType: 5
2019-08-05 16:17:33 +00:00
forumTopicId: 301975
2018-09-30 22:01:58 +00:00
---
2020-11-27 18:02:05 +00:00
# --description--
2018-09-30 22:01:58 +00:00
Let x1, x2,..., xn be a sequence of length n such that:
2020-11-27 18:02:05 +00:00
2018-09-30 22:01:58 +00:00
x1 = 2
2020-11-27 18:02:05 +00:00
for all 1 < i ≤ n : xi-1 < xi
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
for all i and j with 1 ≤ i, j ≤ n : (xi) j < (xj + 1)i
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
There are only five such sequences of length 2, namely: {2,4}, {2,5}, {2,6}, {2,7} and {2,8}. There are 293 such sequences of length 5; three examples are given below: {2,5,11,25,55}, {2,6,14,36,88}, {2,8,22,64,181}.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
Let t(n) denote the number of such sequences of length n. You are given that t(10) = 86195 and t(20) = 5227991891.
2018-09-30 22:01:58 +00:00
Find t(1010) and give your answer modulo 109.
2020-11-27 18:02:05 +00:00
# --hints--
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
`euler319()` should return 268457129.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
```js
assert.strictEqual(euler319(), 268457129);
2018-09-30 22:01:58 +00:00
```
2020-11-27 18:02:05 +00:00
# --seed--
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
## --seed-contents--
2018-09-30 22:01:58 +00:00
```js
function euler319() {
2020-09-15 16:57:40 +00:00
2018-09-30 22:01:58 +00:00
return true;
}
euler319();
```
2020-11-27 18:02:05 +00:00
# --solutions--
2018-09-30 22:01:58 +00:00
```js
// solution required
```