|
Search: id:A120658
|
|
|
| A120658 |
|
9 X 9 Matrix Markov of simple polygonal mesh bonding graph torus: Characteristic polyniomal:80 - 144 x - 56 x^2 + 184 x^3 + 9 x^4 - 89 x^5 - 2 x^6 + 18 x^7 + x^8 - x^9. |
|
+0
3
|
|
| 0, 12, 96, 370, 1654, 6660, 28020, 115190, 478786, 1979288, 8203968, 33961066, 140672814, 582515628, 2412508492, 9990776222, 41375626970, 171349445760, 709617513368, 2938760897682, 12170404119878, 50401719145492
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
A better name for this matrix is a "straight" tripartite K(3) complete graph.
|
|
REFERENCES
|
F. R. K. Chung and R. L. Graham, Erdos on Graphs, AK Peters Ltd., Ma, 1998
Eric Weisstein's World of Mathematics, "Complete Graph." http://mathworld.wolfram.com/CompleteGraph.html
|
|
FORMULA
|
M = {{0, 1, 1, 1, 0, 0, 1, 0, 0}, {1, 0, 1, 0, 1, 0, 0, 1, 0}, {1, 1, 0, 0, 0, 1, 0, 0, 1}, {1, 0, 0, 0, 1, 1, 1, 0, 0}, {0, 1, 0, 1, 0, 1, 0, 1, 0}, {0, 0, 1, 1, 1, 1, 0, 0, 1}, {1, 0, 0, 1, 0, 0, 0, 1, 1}, {0, 1, 0, 0, 1, 0, 1, 0, 1}, {0, 0, 1, 0, 0, 1, 1, 1, 0}} v[1] = Table[Fibonacci[n], {n, 0, 8}] v[n_] := v[n] = M.v[n - 1] a(n) = v[n][[1]]
|
|
MATHEMATICA
|
M = {{0, 1, 1, 1, 0, 0, 1, 0, 0}, {1, 0, 1, 0, 1, 0, 0, 1, 0}, {1, 1, 0, 0, 0, 1, 0, 0, 1}, {1, 0, 0, 0, 1, 1, 1, 0, 0}, {0, 1, 0, 1, 0, 1, 0, 1, 0}, {0, 0, 1, 1, 1, 1, 0, 0, 1}, {1, 0, 0, 1, 0, 0, 0, 1, 1}, {0, 1, 0, 0, 1, 0, 1, 0, 1}, {0, 0, 1, 0, 0, 1, 1, 1, 0}} v[1] = Table[Fibonacci[n], {n, 0, 8}] v[n_] := v[n] = M.v[n - 1] a = Table[Floor[v[n][[1]]], {n, 1, 50}]
|
|
CROSSREFS
|
Adjacent sequences: A120655 A120656 A120657 this_sequence A120659 A120660 A120661
Sequence in context: A021074 A027250 A059154 this_sequence A121627 A138162 A073392
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roger Bagula (rlbagulatftn(AT)yahoo.com), Aug 10 2006
|
|
|
Search completed in 0.002 seconds
|
