Timeline for Modulo $3$ calculations for a binomial-sum sequence
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 24, 2021 at 20:32 | history | edited | T. Amdeberhan | CC BY-SA 4.0 |
edited body
|
| Jun 24, 2021 at 20:07 | history | edited | T. Amdeberhan | CC BY-SA 4.0 |
deleted 1 character in body
|
| Jun 23, 2021 at 22:15 | history | edited | T. Amdeberhan | CC BY-SA 4.0 |
edited body
|
| Jun 22, 2021 at 23:05 | comment | added | Max Alekseyev | I copied g.f. from the OEIS, but I'm pretty sure it can be easily obtained by Lagrange inversion. | |
| Jun 22, 2021 at 23:02 | comment | added | T. Amdeberhan | I liked two things (pedagogically speaking): (1) I noticed what I did not expect, that is, $4t_n=h(n-1)+h(n)$; (2) I noticed the presence of the quantities $3^m$ vanishing mostly. Of course, no doubt about your approach is neater. By the way, how do you prove the generating function works for $t_n$? I saw it appeared on OEIS. | |
| Jun 22, 2021 at 22:48 | comment | added | Max Alekseyev | What is benefit of this explicit expansion? | |
| Jun 22, 2021 at 22:43 | history | answered | T. Amdeberhan | CC BY-SA 4.0 |