login

Revision History for A106750

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Define the "Fibonacci" morphism f: 1->12, 2->1 and let a(0) = 2; then a(n+1) = f(a(n)).
(history; published version)
#17 by N. J. A. Sloane at Fri Sep 09 08:47:10 EDT 2016
STATUS

editing

approved

#16 by N. J. A. Sloane at Fri Sep 09 08:47:07 EDT 2016
REFERENCES

Berstel, Jean. "Fibonacci words—a survey." In The book of L, pp. 13-27. Springer Berlin Heidelberg, 1986.

STATUS

approved

editing

#15 by Jon E. Schoenfield at Thu Jul 30 22:50:38 EDT 2015
STATUS

editing

approved

#14 by Jon E. Schoenfield at Thu Jul 30 22:50:35 EDT 2015
MATHEMATICA

FromDigits /@ NestList[ Flatten[ # /. {1 -> {1, 2}, 2 -> 1}] &, {2}, 8] (from _* _Robert G. Wilson v_, May 17 2005 *)

STATUS

approved

editing

#13 by N. J. A. Sloane at Thu Jul 05 10:38:35 EDT 2012
STATUS

editing

approved

#12 by N. J. A. Sloane at Thu Jul 05 10:38:31 EDT 2012
STATUS

approved

editing

#11 by N. J. A. Sloane at Thu Jul 05 10:31:02 EDT 2012
STATUS

editing

approved

#10 by N. J. A. Sloane at Thu Jul 05 10:30:55 EDT 2012
LINKS

N. J. A. Sloane, <a href="/A106750/b106750.txt">Table of n, a(n) for n = 0..15</a>

STATUS

approved

editing

#9 by N. J. A. Sloane at Thu Jul 05 10:25:18 EDT 2012
STATUS

editing

approved

#8 by N. J. A. Sloane at Thu Jul 05 10:25:15 EDT 2012
NAME

Define the "Fibonacci" morphism f: 1->12, 2->1 and let a(0) = 12; then a(n+1) = f(a(n)).

DATA

2, 1, 12, 121, 12112, 12112121, 1211212112112, 121121211211212112121, 1211212112112121121211211212112112, 1211212112112121121211211212112112121121211211212112121

OFFSET

0,21

COMMENTS

a(n) has length Fibonacci(n+1) (cf. A000045).

MATHEMATICA

FromDigits /@ NestList[ Flatten[ # /. {1 -> {1, 2}, 2 -> 1}] &, {12}, 8] (from Robert G. Wilson v, May 17 2005)

CROSSREFS
AUTHOR

N. J. A. Sloane, May 16 2005. Initial term 2 added by _N. J. A. Sloane_, Jul 05 2012

STATUS

approved

editing