|
%I #15 Dec 18 2022 08:38:49
%S 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,
%T -4,-8,-1,-8,4,-4,7,4,7,11,3,14,-5,10,-11,-1,-15,-16,-11,-26,0,-25,15,
%U -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
%N A nonsense sequence.
%t (* Editors' note: this is not a valid program. *)
%t (* Adamson's matrix functions alternating x^4-x^3-x^2-x-1 Pisot*)
%t (* and x^4-x^3-1 minimal Pisot theta1*)
%t digits=200
%t Solve[x^4-x^3-1==0, x]
%t k=theta1 real root
%t q=N[k-1/k^3, 20]
%t m0={{0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {1, 0, 0, -q}}
%t NSolve[x^4-x^3-x^2-x-1==0, x]
%t k1=1.9275619754829254
%t q1=k1^2-k1-1/k1-1/k1^2
%t m1={{0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {1, 1, 1, q}}
%t m[n_Integer?Positive] := If[Mod[n, 2]==0, m[n-1].m0, m[n-1].m1]
%t m[0] ={{1, 0, 0, 0}, {0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}}
%t a=Table[Floor[m[n][[4, 4]]], {n, 1, digits}]
%K sign,uned,less
%O 1,10
%A _Roger L. Bagula_, Dec 04 2003
|
