login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105778 Trajectory of 1 under the morphism 1->{1,2,1,2,1}, 2->{4,3,4,3,4}, 3->{2,1,2,1,2}, 4->{3,4,3,4,3}. 0
1, 2, 1, 2, 1, 4, 3, 4, 3, 4, 1, 2, 1, 2, 1, 4, 3, 4, 3, 4, 1, 2, 1, 2, 1, 3, 4, 3, 4, 3, 2, 1, 1, 1, 2, 3, 4, 3, 4, 3, 2, 1, 1, 1, 2, 3, 4, 3, 4, 3, 1, 2, 1, 2, 1, 4, 3, 4, 3, 4, 1, 2, 1, 2, 1, 4, 3, 4, 3, 4, 1, 2, 1, 2, 1, 3, 4, 3, 4, 3, 2, 1, 1, 1, 2, 3, 4, 3, 4, 3, 2, 1, 1, 1, 2, 3, 4, 3, 4, 3, 1, 2, 1, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Edgar-Peano substitution of 4 symbols taken 5 at a time, second type: characteristic polynomial -x^5+5*x^3+5*x^2-25*x.

LINKS

Table of n, a(n) for n=0..104.

F. M. Dekking, Recurrent Sets, Advances in Mathematics, vol. 44, no.1, April 1982, page 85, section 4.1.

G. A. Edgar and Jeffery Golds, A Fractal Dimension Estimate for a Graph-Directed IFS of Non-Similarities, arXiv:math/9806039 [math.CA], 1991

Index entries for sequences that are fixed points of mappings

MATHEMATICA

s[1] = {1, 2, 1, 2, 1}; s[2] = {4, 3, 4, 3, 4}; s[3] = {2, 1, 1, 1, 2}; s[4] = {3, 4, 3, 4, 3}; s[5] = {} t[a_] := Flatten[s /@ a]; p[0] = {1}; p[1] = t[p[0]]; p[n_] := t[p[n - 1]]; aa = p[3]

CROSSREFS

Sequence in context: A090924 A247074 A160595 * A308213 A226279 A088931

Adjacent sequences:  A105775 A105776 A105777 * A105779 A105780 A105781

KEYWORD

nonn

AUTHOR

Roger L. Bagula, May 04 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 24 04:38 EDT 2019. Contains 324318 sequences. (Running on oeis4.)