|
Search: id:A152306
|
|
|
| A152306 |
|
Really simple chaotic sequence generator: a(n)=Mod[Floor[Log[2]*((1 + Sqrt[3])/2)^n]]. |
|
+0
1
|
|
| 0, 0, 1, 1, 2, 3, 4, 6, 8, 1, 5, 1, 9, 9, 4, 4, 1, 9, 0, 9, 4, 4, 2, 4, 5, 7, 5, 9, 2, 6, 7, 5, 9, 2, 2, 4, 0, 2, 2, 8, 5, 4, 7, 9, 8, 3, 8, 4, 9, 1, 6, 1, 4, 5, 3, 0, 7, 2, 6, 3, 6, 8, 1, 5, 1, 3, 9, 6, 0, 9, 9, 8, 3, 8, 5, 9, 1, 1, 7, 7, 1, 5, 5, 8, 6, 5, 3, 6, 8, 1, 0, 0, 6, 6, 9, 8, 2, 2, 8, 9, 8
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
COMMENT
|
Derived from the Mathematica generated binet:
f[n_Integer] = Module[{a}, a[n] /. RSolve[{a[n] == a[n - 2] + a[n - 3] + a[n - 1]/10,a[0] == 1, a[1] == 1, a[2] == 1}, a[n], n][[1]] // FullSimplify] ;
by plotting the 3 parts in 3D and recognizing that the real part was the major
contributor to the sequence and using the nearest constants in that part.
|
|
FORMULA
|
a(n)=Mod[Floor[Log[2]*((1 + Sqrt[3])/2)^n]].
|
|
MATHEMATICA
|
Clear[f]; f[n_] = Log[2]*((1 + Sqrt[3])/2)^n;
Table[Mod[Floor[f[n]], 10], {n, 0, 100}]
|
|
CROSSREFS
|
Sequence in context: A077292 A036413 A069912 this_sequence A120817 A166310 A109852
Adjacent sequences: A152303 A152304 A152305 this_sequence A152307 A152308 A152309
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Dec 02 2008
|
|
|
Search completed in 0.002 seconds
|
