Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A008352
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A008352 a(n) is formed by concatenating a(n-2) and a(n-1), with a(0) = 1, a(1) = 2; +0
7
1, 2, 12, 212, 12212, 21212212, 1221221212212, 212122121221221212212, 1221221212212212122121221221212212, 2121221212212212122121221221212212212122121221221212212 (list; graph; listen)
OFFSET

0,2

COMMENT

A "non-commutative Fibonacci" (or "reverse Fibonacci") sequence. Often written as: a, b, ab, bab, abbab, bababbab, abbabbababbab, bababbababbabbababbab, abbabbababbabbababbababbabbababbab, bababbababbabbababbababbabbababbabbababbababbabbababbab, ...

Converges in the appropriate topology. - Dylan Thurston, Jan 28 2005

Do a web search on bababbababbabbababbab to get further links.

Comments from A. N. W. Hone, Jan 28 2005: [Start] Write the recurrence symbolically as g_{n+1} = g_{n-1}g_n. Then the determinant d_n = det g_n is given by d_n = d_0^{f_{n-2}} d_1^{f_{n-1}} where f_{n+1} = f_n+f_{n-1}, f_0 = f_1 = 1 are the Fibonacci numbers.

To avoid getting involved with the Baker-Campbell-Hausdorff identity, I now restrict to SL(2), or to make life easier make it SU(2) (which is isomorphic over C). Then we can explicitly write g as an exponential of Lie algebra elements:

g_n = exp (i theta_n v_n cdot sigma ), where theta_n is an angle, v_n is a unit vector and sigma = ( sigma_1, sigma_2, sigma_3)^T is a vector of Pauli spin matrices.

Moreover the adjoint action on su(2) (viewing the coordinates in su(2) as giving points in 3D space) means that g_n gives a rotation through - theta_n /2 about the v_n axis.

So from the double cover of SO(3) by SU(2), we can view the g_n as a sequence of "Fibonacci rotations."

Furthermore, in SU(2) we can write explicitly g_n = cos theta_n + i sin theta_n v_n cdot sigma so the recurrence can be decoupled as

cos theta_{n+1} = cos theta_n + cos theta_{n-1} - sin theta_{n-1} sin theta_n (v_{n-1} cdot v_n),

sin theta_{n+1} v_{n+1} = cos theta_{n-1} sin theta_n v_n + cos theta_n sin theta_{n-1} v_{n-1} - sin theta_{n-1} sin theta_n ( v_{n-1} wedge v_n ) [End]

REFERENCES

S. Brlek, E. Duchi, E. Pergola and S. Rinaldi, On the equivalence problem for succession rules, Discr. Math., 298 (2005), 142-154.

D. E. Knuth, "The Art of Programming", Volume 1, "Fundamental Algorithms", third edition, problem 36 on page 86.

K. B. Stolarsky, Canadian Math. Bull. 19 (1976) pp. 473-482.

LINKS

N. J. A. Sloane, Table of n, a(n) for n = 0..15

Wikipedia, Lindenmayer system

A. Vieru, Lindenmayer systems and primes, arXiv:math.NT/0803.0852 .

FORMULA

Changing the offset to 1, let a(1)=1 and a(2)=2, then a(n)=a(n-1)+10^A000045(n)*a(n-2). - Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 24 2001

Changing the offset to 1, the sum of the digits of a(n) is 2*Fib(n-1)+Fib(n-2), where Fib(n) means A000045(n), the n-th Fibonacci number. - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Feb 05 2006

MAPLE

f:=proc(n) option remember; if n = 0 then return(`1`); fi; if n = 1 then return(`2`); fi; cat(f(n-2), f(n-1) ); end;

CROSSREFS

See A008351 and A003849 for other versions. Cf. A000045, A133235.

Sequence in context: A012598 A156489 A129893 this_sequence A082491 A153302 A123118

Adjacent sequences: A008349 A008350 A008351 this_sequence A008353 A008354 A008355

KEYWORD

nonn,base

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com) and J. H. Conway (conway(AT)math.princeton.edu)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research