How the odd terms in the Fibonacci sequence stack up

Author:

Rinaldi S.,Rogers D. G.

Abstract

Dedicated to H. N. V. Temperley on the occasion of his ninetieth birthday 4 March 2005The authors of the recent Note [1] exhibit an odd preference. They derive recurrence relations for the odd terms, un = F2n+1, n ≥ 0, in the sequence of Fibonacci numbers, Fn, defined by

Publisher

Cambridge University Press (CUP)

Subject

General Mathematics

Reference14 articles.

1. Feedback: Note 88.02;Maynard;Math. Gaz,2004

2. Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules

3. Proofs that really count: the art of combinatorial proof;Benjamin;Dolciani Mathematical Expositions,2003

4. Painting by numbers or Polyominoes revisited

5. Delving Deeper: Things Fall Apart: A Recurrence of Tiling

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Indecomposability: polyominoes and polyomino tilings;The Mathematical Gazette;2008-07

2. Combinatorial aspects of L-convex polyominoes;European Journal of Combinatorics;2007-08

3. Enumeration of L-convex polyominoes by rows and columns;Theoretical Computer Science;2005-11

4. On directed-convex polyominoes in a rectangle;Discrete Mathematics;2005-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3