We thus see that when n=1, nine Operation-cards are used; that when n=2, fourteen Operation-cards are used; and that when n>2, twenty-five Operation-cards are used; but that no more are needed, however great n may be; and not only this, but that these same twenty-five cards suffice for the successive computation of all the Numbers from B1 to B2n-1 inclusive.