recursively defined sequence
C7465
concept
A recursively defined sequence is a sequence of numbers or objects in which each term is specified in terms of one or more preceding terms together with one or more initial values.
All labels observed (4)
| Label | Occurrences |
|---|---|
| mathematical sequence | 3 |
| integer sequence family | 1 |
| recursively defined sequence canonical | 1 |
| sequence of rational numbers | 1 |
Description generation (CDg)
The one-sentence description above was generated by prompting gpt-5.1 with the class name and this instruction.
Instruction
generate a one-sentence description for a given conceptual class. # Response Format Return only the sentence: "Description: [one-sentence description of the conceptional class]"
Input
Class: recursively defined sequence
Generated description
A recursively defined sequence is a sequence of numbers or objects in which each term is specified in terms of one or more preceding terms together with one or more initial values.
Instances (6)
| Instance | Via concept surface |
|---|---|
| Bernoulli numbers | sequence of rational numbers |
| Look-and-say sequence | — |
| Lucas sequences | integer sequence family |
| Sylvester sequence | mathematical sequence |
| Farey sequence | mathematical sequence |
| Ulam sequence | mathematical sequence |