The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A089062 A nonsense sequence. 0

%I #15 Dec 18 2022 07:43:26

%S 1,0,1,-1,1,-1,0,-2,-1,-1,-2,0,-2,0,-1,1,0,0,1,-1,1,-1,0,-2,-1,-1,-2,

%T 0,-2,0,-1,1,0,0,1,-1,1,-1,0,-2,-1,-1,-2,0,-2,0,-1,1,0,0,1,-1,1,-1,0,

%U -2,-1,-1,-2,0,-2,0,-1,1,0,0,1,-1,1,-1,0,-2,-1,-1,-2,-1,-2,0,-1,1,0,0,1,0,1,-1,0,-2,-1,-1,-2,-1,-2,0,-1,1,0,1,1,1,1,0,1

%N A nonsense sequence.

%t (* Adamson's matrix functions alternating golden mean and minimal Pisot*)

%t digits = 20

%t NSolve[x^3 - x - 1 == 0, x]

%t k = -1.32471795724474605

%t q = k - 1/k

%t m0 = {{0, 1}, {1, q}}

%t NSolve[x^2 - x - 1 == 0, x]

%t k1 = 1.6180339887498949

%t q1 = k1 - 1/k1

%t m1 = {{0, 1}, {1, q1}}

%t m[n_Integer?Positive] := If[Mod[n, 2] == 0, m[n - 1].m0, m[n - 1].m1]

%t m[0] = {{1, 0}, {0, 1}}

%t a = Table[Floor[m[n][[2, 2]]], {n, 1, digits}]

%K sign,uned,obsc,less

%O 1,8

%A _Roger L. Bagula_, Dec 02 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 14 10:49 EDT 2024. Contains 375921 sequences. (Running on oeis4.)