期刊名称：International Journal of Mathematics and Mathematical Sciences
印刷版ISSN：0161-1712
电子版ISSN：1687-0425
出版年度：1992
卷号：15
DOI：10.1155/S0161171292000656
出版社：Hindawi Publishing Corporation
摘要：We start with finitely many 1's and possibly some 0's in between. Then each entry in the other rows is obtained from the Base 2 sum of the two numbers diagonally above it in the preceding row. We may formulate the game as follows: Define d1,j recursively for 1, a non-negative integer, and j an arbitrary integer by the rules:d0,j={1     for   j=0,k         (I)0   or   1   for   0<j<kd0,j=0   for   j<0   or   j>k              (II)di
