Subject
General Computer Science,Theoretical Computer Science
Reference20 articles.
1. E. Barcucci, S. Brunetti, A. Del Lungo, F. Del Ristoro, A combinatorial interpretation of the recurrence fn+1=6fn−fn−1, Discrete Math. 190 (1998) 235–240.
2. E.R. Berlekamp, J.H. Conway, R.K. Guy, Winning Ways (two volumes), Academic Press, London, 1982.
3. J. Bonin, L. Shapiro, R. Simion, Some q-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths, J. Statist. Plann. Inference 34 (1993) 35–55.
4. On Numbers and Games;Conway,1976
5. H.S.M. Coxeter, The golden section, phyllotaxis and Wythoff's game, Scripta Math. 19 (1953) 135–143.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献