Timeline for Correctness of the algorithm for the A329369, A347205 and related sequences

8 events

when toggle format	what		by	license	comment
Jul 12 at 13:27	history	edited	Notamathematician	CC BY-SA 4.0	edited body
May 7 at 17:53	vote	accept	Notamathematician
May 7 at 11:41	answer	added	Peter Taylor		timeline score: 4
May 7 at 10:35	comment	added	Peter Taylor		My Sage code. I've generalised the binomial coefficients to an arbitrary triangle of coefficients $C_{n,k}$ and it still seems to work. Note that for your final question, $k$ is just $C_{1,0}$. I observe that the process can be rewritten by taking $t$ to be an infinite sequence of $1$s and then for each bit in $n$, most significant first, if it's a $1$ we multiply by the triangular matrix $C$ and if it's a $0$ we shift off the first element of $t$. The result is $t_0$ after the process completes.
May 7 at 6:33	comment	added	Notamathematician		@PeterTaylor, thank you for comment! Done. Here $L$ is the number of $0$s in the binary expansion of $2n$.
May 7 at 6:30	history	edited	Notamathematician	CC BY-SA 4.0	edited body
May 6 at 11:02	comment	added	Peter Taylor		I presume in the definition of $L$ that the bound variable should be $k$ rather than $i$, but I'm not sure about the indexing of $T$. Is $L$ the number of $1$s in the binary expansion of $2n$, or the number of $0$s?
May 4 at 18:48	history	asked	Notamathematician	CC BY-SA 4.0