The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A152306 Simple 'chaotic' sequence: a(n)=floor(log(2)*((1 + sqrt(3))/2)^n) mod 10. 0
 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; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS 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. LINKS FORMULA a(n)=floor(log(2)*((1 + sqrt(3))/2)^n) mod 10 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: A171249 A036413 A069912 * A120817 A327887 A339361 Adjacent sequences:  A152303 A152304 A152305 * A152307 A152308 A152309 KEYWORD nonn,less AUTHOR Roger L. Bagula, Dec 02 2008 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.

Last modified December 7 22:50 EST 2021. Contains 349590 sequences. (Running on oeis4.)