correct ordered bell dp recursion

_posts/2024-10-14-blog-post.md

@@ -108,7 +108,7 @@ $$k!{n \brace k}$$.
 
 To calculate these the recursion is easily seen as
 
-$$b(n,k) = k{n-1 \brace k} + k{n-1 \brace k-1}$$.
+$$b(n,k) = kb(n-1, k) + kb(n-1,k-1)$$.
 
 In other words we're multiplying both items by $$k$$.
 We can interpret this as each non-empty subset being distinguished in some way,