Timeline for The closed-form expression for $C_n$ sequence
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 19, 2017 at 16:43 | vote | accept | Amin235 | ||
| Sep 16, 2016 at 15:30 | history | edited | Amin235 | CC BY-SA 3.0 |
improved
|
| Sep 15, 2016 at 17:55 | answer | added | Robert Israel | timeline score: 3 | |
| Sep 15, 2016 at 13:37 | comment | added | Amin235 | @GerryMyerson maybe a reasonable answer to your question is the structure of $C_n$ sequence. In fact, $C_n$ sequence is partitioned by the two dimensional Tribonacci sequence oeis.org/A213816 | |
| Sep 15, 2016 at 13:16 | comment | added | Gerry Myerson | But, Amin, what makes you think there is a simpler form for this function? | |
| Sep 15, 2016 at 11:07 | comment | added | მამუკა ჯიბლაძე | There are well known expressions of power sums through elementary symmetric functions, you can use these. Equivalently (wrt your case) there are explicit formulæ for coefficients of reciprocal series. | |
| Sep 15, 2016 at 10:23 | comment | added | Amin235 | @GerryMyerson you right. I edited my question to clarify what I mean. | |
| Sep 15, 2016 at 10:22 | history | edited | Amin235 | CC BY-SA 3.0 |
improved
|
| Sep 15, 2016 at 8:20 | comment | added | Gerry Myerson | So, you have found a closed-form solution, but you are not happy because it is complicated. Well, maybe it is complicated, and you just have to live with it. | |
| Sep 15, 2016 at 6:43 | history | asked | Amin235 | CC BY-SA 3.0 |