Timeline for How to solve the recursive formula $P(n)=\sum_{k=1}^{n-1}P(k)P(n-k)$
Current License: CC BY-SA 3.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Dec 9, 2017 at 9:53 | history | suggested | Maxim | CC BY-SA 3.0 |
fix the title
|
| Dec 9, 2017 at 8:31 | review | Suggested edits | |||
| S Dec 9, 2017 at 9:53 | |||||
| Dec 4, 2017 at 8:06 | vote | accept | gds | ||
| Dec 3, 2017 at 9:25 | comment | added | Goldstern | The naive way to "solve" this is to compute the first few values, and then ask oeis | |
| Dec 3, 2017 at 9:01 | comment | added | Will Sawin | @FedorPetrov Well, $P(n+1) = C(n)$. | |
| Dec 3, 2017 at 8:54 | history | edited | YCor |
edited tags
|
|
| Dec 3, 2017 at 8:48 | answer | added | VictorZurkowski | timeline score: 11 | |
| Dec 3, 2017 at 7:54 | comment | added | Fedor Petrov | these are exactly Catalan numbers, are not they? | |
| S Dec 3, 2017 at 7:51 | history | edited | David Roberts♦ | CC BY-SA 3.0 |
English edits; fixed TeX in title.
|
| S Dec 3, 2017 at 7:51 | history | suggested | Amir Sagiv | CC BY-SA 3.0 |
English edits
|
| Dec 3, 2017 at 7:44 | review | Suggested edits | |||
| S Dec 3, 2017 at 7:51 | |||||
| Dec 3, 2017 at 7:39 | review | Close votes | |||
| Dec 4, 2017 at 11:39 | |||||
| Dec 3, 2017 at 7:38 | comment | added | Péter Komjáth | This may be connected to Catalan numbers: en.wikipedia.org/wiki/Catalan_number | |
| Dec 3, 2017 at 7:11 | review | First posts | |||
| Dec 3, 2017 at 7:44 | |||||
| Dec 3, 2017 at 7:10 | history | asked | gds | CC BY-SA 3.0 |