Spot-Based Generations for Meta-Fibonacci Sequences

被引:11
作者
Dalton, Barnaby [1 ]
Rahman, Mustazee [2 ]
Tanny, Stephen [2 ]
机构
[1] IBM Canada, Toronto, ON L3R 9Z7, Canada
[2] Univ Toronto, Dept Math, Toronto, ON M5S 2E4, Canada
关键词
Connolly sequence; Conway sequence; meta-Fibonacci sequence; spot-based generation; spot function; CONWAYS RECURSIVE SEQUENCE; COUSIN;
D O I
10.1080/10586458.2011.544565
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
For many meta-Fibonacci sequences it is possible to identify a partition of the sequence into successive intervals (sometimes called blocks) with the property that the sequence behaves "similarly" in each block. This partition provides insights into the sequence properties. To date, for any given sequence, only ad hoc methods have been available to identify this partition. We apply a new concept-the spot-based generation sequence-to derive a general methodology for identifying this partition for a large class of meta-Fibonacci sequences. This class includes the Conolly and Conway sequences and many of their well-behaved variants, and even some highly chaotic sequences, such as Hof-stadter's famous Q-sequence.
引用
收藏
页码:129 / 137
页数:9
相关论文
共 15 条
[1]  
Balamohan B., 2007, J INTEGER SEQUENCES, V10, P0771
[2]   On the behavior of a family of meta-Fibonacci sequences [J].
Callaghan, J ;
Chew, JJ ;
Tanny, SM .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 18 (04) :794-824
[3]  
Conolly B.W., 1989, Fibonacci Lucas Numbers, and the Golden Section, P127
[4]   Another variation on Conway's recursive sequence [J].
Grytczuk, J .
DISCRETE MATHEMATICS, 2004, 282 (1-3) :149-161
[5]  
GUY R. K., 2004, Unsolved Problems in Number Theory
[6]  
Hofstadter D.R., 1979, GODEL ESCHER BACH ET
[7]  
Isgur A, 2009, ELECTRON J COMB, V16
[8]  
KLEITMAN DJ, 1991, AM MATH MON, V98, P958
[9]   On Conway's recursive sequence [J].
Kubo, T ;
Vakil, R .
DISCRETE MATHEMATICS, 1996, 152 (1-3) :225-252
[10]   CONWAY CHALLENGE SEQUENCE [J].
MALLOWS, CL .
AMERICAN MATHEMATICAL MONTHLY, 1991, 98 (01) :5-20