editing
approved
editing
approved
<a href="/index/Ph#Pisot">Index entries for Pisot sequences</a>
approved
editing
(MAGMAMagma) Tiv:=[3, 9]; [n le 2 select Tiv[n] else Ceiling(Self(n-1)^2/Self(n-2))-1: n in [1..40]]; // Bruno Berselli, Feb 17 2016
editing
approved
LinearRecurrence[{3, 0, -1}, {3, 9, 26}, 30] (* Harvey P. Dale, Feb 06 2019 *)
approved
editing
editing
approved
Not to be confused with the Pisot LT(3,9) sequence, which is A000244. - R. J. Mathar, Feb 13 2016
RecurrenceTable[{a[1] == 3, a[2] == 9, a[n] == Ceiling[a[n-1]^2/a[n-2]] - 1}, a, {n, 30}] (* Bruno Berselli, Feb 17 2016 *)
Define the generalized Pisot sequence LT(a_(0,),a_(1) ) by : a_{(n+2} ) is the greatest integer such that a_{(n+2})/a_{(n+1} ) < a_{(n+1})/a_n for (n >= 0 ). This is LT(3,9).
Let M denotes the 4 X 4 matrix = row by row (1,1,1,1)(1,1,1,0)(1,1,0,0)(1,0,0,0) and A(n) the vector (x(n),y(n),z(n),t(n))=M^n*A where A is the vector (1,1,1,1) then a(n)=y(n+1) . - Benoit Cloitre, Apr 02 2002
(MAGMA) Tiv:=[3, 9]; [n le 2 select Tiv[n] else Ceiling(Self(n-1)^2/Self(n-2))-1: n in [1..40]]; // Bruno Berselli, Feb 17 2016
approved
editing
proposed
approved