Recently, I stumbled upon Rascal's Triangle. You can read more about it [here](https://mathworld.wolfram.com/RascalTriangle.html). Basically it is very like Pascal's Triangle but a bit different. I know that there is a $O(n)$ [solution](https://www.geeksforgeeks.org/find-the-nth-row-in-pascals-triangle/) for Pascal's Triangle. I would want to calculate the $nth$ row in $O(n)$ mod $998244353$. Help?
