OFFSET
0,1
COMMENTS
Agrees with A019484 for terms 0 through 11055 but then differs from it. It is not known if S(8,55) satisfies a linear recurrence.
a(11056) = 4971494197...7586894095 (9270 digits) = A019484(11056) + 1. - Jianing Song, Oct 15 2021
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
D. W. Boyd, Some integer sequences related to the Pisot sequences, Acta Arithmetica, 34 (1979), 295-305.
D. W. Boyd, Linear recurrence relations for some generalized Pisot sequences, in Advances in Number Theory (Kingston ON, 1991), pp. 333-340, Oxford Univ. Press, New York, 1993; with updates from 1996 and 1999.
Andrew Bremner, Review of The Book of Numbers by John Horton Conway; Richard K. Guy, The American Mathematical Monthly, Vol. 104, No. 9 (Nov, 1997), pp. 884-888. See page 886.
Jeffrey Shallit, Problem B-686, Fib. Quart., 29 (1991), 85.
PROG
(PARI) pisotS(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));
a
}
pisotS(50, 8, 55) \\ Colin Barker, Aug 09 2016
CROSSREFS
KEYWORD
nonn,changed
AUTHOR
STATUS
approved