### Qualified's blog

By Qualified, history, 7 weeks ago,

Recently, I stumbled upon Rascal's Triangle. You can read more about it here. Basically it is very like Pascal's Triangle but a bit different. I know that there is a $O(n)$ solution for Pascal's Triangle. I would want to calculate the $nth$ row in $O(n)$ mod $998244353$. Help?

• +5

 » 7 weeks ago, # |   0 Auto comment: topic has been updated by Qualified (previous revision, new revision, compare).
 » 7 weeks ago, # |   +25 Isn't it just $k(n - k) + 1$ for the $n$-th row and $k$-th column?
•  » » 7 weeks ago, # ^ | ← Rev. 2 →   -19 Is the first row the 0-th row or the 1st row and is the first column the 0-th column or the 1st column?