satisfiesRecurrence
P25791
predicate
Indicates that one entity fulfills or conforms to a specified recurrence relation defined by another entity.
Aliases (2)
- definedByRecurrence ×2
- recurrenceRule ×2
Sample triples (5)
| Subject | Object |
|---|---|
| Fibonacci sequence | F(n) = F(n−1) + F(n−2) ("definedByRecurrence") → |
| Knuth’s up-arrow notation | a ↑^n (b+1) = a ↑^{n-1} (a ↑^n b) for n ≥ 2, b ≥ 1 ("recurrenceRule") → |
| Knuth’s up-arrow notation | a ↑^n 1 = a for n ≥ 1 ("recurrenceRule") → |
| Pascal's triangle | C(n,k) = C(n-1,k-1) + C(n-1,k) → |
| Ulam sequence | Each subsequent term is the smallest integer that can be written uniquely as the sum of two distinct earlier terms ("definedByRecurrence") → |