Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098053
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098053 Let M={{0,1,0},{0,0,1},{1,1,0}}; a[n_]:=M.a[n-1]-a[n-1].M; a[0]:={{0,1,1},{1,1,2},{1,2,3}}. +0
1
1, 1, 2, 1, 2, 3, 1, 2, 3, 1, 1, 2, 2, 2, 1, 1, 1, 3, 4, 3, 2, 2, 0, 5, 6, 5, 4, 4, 2, 8, 11, 8, 4, 10, 1, 12, 19, 12, 2, 14, 6, 20, 27, 8, 13, 16, 23, 32, 47, 14, 7, 46, 8, 30, 79, 30, 16, 53, 48, 44, 93, 25, 31, 37, 143, 74, 137, 34, 17, 163, 80, 3, 211, 3, 160, 146, 234, 31, 177, 337 (list; graph; listen)
OFFSET

0,3

COMMENT

Minimal Pisot 3 X 3 Commutator Markov sequence.

MATHEMATICA

(* Minimal Pisot 3 X 3 Commutator Markov sequence*) digits=16 M={{0, 1, 0}, {0, 0, 1}, {1, 1, 0}} A[n_]:=M.A[n-1]-A[n-1].M; A[0]:={{0, 1, 1}, {1, 1, 2}, {1, 2, 3}}; (* flattened sequence of 3 X 3 matrices made with a Minimal Pisot recurrence*) b=Flatten[Table[M.A[n], {n, 0, digits}]] Abs[b] Dimensions[b][[1]] ListPlot[b, PlotJoined->True]

CROSSREFS

Adjacent sequences: A098050 A098051 A098052 this_sequence A098054 A098055 A098056

Sequence in context: A082691 A036043 A128628 this_sequence A128117 A023115 A061336

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Sep 11 2004

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 October 6 16:13 EDT 2008. Contains 144667 sequences.


AT&T Labs Research