The recurrence, one step
The rule, one step: n = 1
row n + 1 = 2 of Pascal's triangle
1
2
1
j runs from 0 to n: the first two
+
= 0
substitute B
0
= 1; B
1
is the one unknown
Every term is known except the last.
Substitute, and solve for it.