Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A106117
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A106117 Substitution sequence that simulates a three level two state neural net in six symbols : Fibonacci-Silver Chain-Fibonacci. +0
1
3, 5, 6, 5, 1, 1, 2, 1, 3, 3, 3, 4, 3, 5, 6, 5, 5, 6, 5, 5, 6, 5, 5, 5, 6, 5, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 3, 3, 3, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 4, 3, 5, 6, 5, 5, 6, 5, 5, 6, 5, 5, 5, 6, 5, 5, 6, 5, 5, 6, 5, 5, 6, 5, 5, 5, 6, 5, 5, 6, 5, 5, 6, 5, 5, 6, 5, 5, 5, 6, 5, 5, 6 (list; graph; listen)
OFFSET

0,1

COMMENT

It is a triangular level, two state each, state machine: {1,2},{3,4},{5,6} I show all three levels. Projection on an hexagon: bb=aa/. 1->{0.5, 0.8660254037844386}/. 2->{0.5,-0.8660254037844386}/. 3->{1,0} /. 4 ->{0.5,0.8660254037844386}/. 5->{0.5,-0.8660254037844386}/. 6->{1,0}; ListPlot[FoldList[Plus, {0, 0}, bb], PlotJoined -> True, PlotRange -> All, Axes -> False];

FORMULA

1->{3}, 2->{3, 4}, 3->{5, 6, 5}, 4->{5}, 5->{1}, 6->{1, 2}

MATHEMATICA

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

CROSSREFS

Sequence in context: A152713 A078064 A091517 this_sequence A081498 A110279 A077859

Adjacent sequences: A106114 A106115 A106116 this_sequence A106118 A106119 A106120

KEYWORD

nonn,uned

AUTHOR

Roger Bagula (rlbagulatftn(AT)yahoo.com), May 07 2005

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 December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research