OFFSET
0,1
COMMENTS
Satisfies a(n) = 33 a(n - 1) - 2 a(n - 2) + 30 a(n - 3) - 11 a(n - 4) for 4 <= n <= 15888 but not for n = 15889. It is not known if there is a linear recurrence which is valid for all n.
LINKS
Colin Barker, Table of n, a(n) for n = 0..650
S. B. Ekhad, N. J. A. Sloane, D. Zeilberger, Automated proofs (or disproofs) of linear recurrences satisfied by Pisot Sequences, arXiv:1609.05570 [math.NT] (2016)
MATHEMATICA
a[0] = 30; a[1] = 989; a[n_] := a[n] = Floor[a[n-1]^2/a[n-2] + 1/2];
Table[a[n], {n, 0, 17}] (* Jean-François Alcover, Oct 10 2018 *)
PROG
(PARI) pisotE(nmax, a1, a2) = {
a=vector(nmax); a[1]=a1; a[2]=a2;
for(n=3, nmax, a[n] = floor(a[n-1]^2/a[n-2]+1/2));
a
}
pisotE(20, 30, 989) \\ Colin Barker, Sep 11 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Sep 10 2016
STATUS
approved