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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089077 A nonsense sequence. 3
0, 0, 1, 0, 0, -1, 0, -1, -1, -2, -2, -1, -2, 0, -2, 2, 0, 1, 2, 1, 4, -1, 3, -4, -1, -5, -5, -4, -8, -1, -8, 4, -4, 7, 4, 7, 11, 3, 14, -5, 10, -11, -1, -15, -16, -11, -26, 0, -25, 15, -10, 25, 15, 24, 40, 9, 49, -16, 33, -41, -7, -50, -57, -34, -90, 6, -83, 56, -27, 89, 62, 82, 145, 26, 171, -63, 108, -146, -37, -172, -209, -109, -316 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,10
LINKS
MATHEMATICA
(* Editors' note: this is not a valid program. *)
(* Adamson's matrix functions alternating x^4-x^3-x^2-x-1 Pisot*)
(* and x^4-x^3-1 minimal Pisot theta1*)
digits=200
Solve[x^4-x^3-1==0, x]
k=theta1 real root
q=N[k-1/k^3, 20]
m0={{0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {1, 0, 0, -q}}
NSolve[x^4-x^3-x^2-x-1==0, x]
k1=1.9275619754829254
q1=k1^2-k1-1/k1-1/k1^2
m1={{0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {1, 1, 1, q}}
m[n_Integer?Positive] := If[Mod[n, 2]==0, m[n-1].m0, m[n-1].m1]
m[0] ={{1, 0, 0, 0}, {0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}}
a=Table[Floor[m[n][[4, 4]]], {n, 1, digits}]
CROSSREFS
Sequence in context: A128580 A104405 A156381 * A203398 A339275 A225064
KEYWORD
sign,uned,less
AUTHOR
Roger L. Bagula, Dec 04 2003
STATUS
approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 01:36 EDT 2024. Contains 371264 sequences. (Running on oeis4.)