|
|
A010924
|
|
Pisot sequence E(8,55), a(n) = floor(a(n-1)^2/a(n-2) + 1/2).
|
|
1
|
|
|
8, 55, 378, 2598, 17856, 122724, 843480, 5797224, 39844224, 273848688, 1882157472, 12936036960, 88909166592, 611071221312, 4199882327424, 28865721292416, 198393621719040, 1363556058068736, 9371698078726656, 64411524820772352, 442699337396994048
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
LINKS
|
|
|
FORMULA
|
Conjecture: a(n) = 6*a(n-1) + 6*a(n-2), n > 1; a(0)=8, a(1)=55; g.f.: (8+7x)/(1-6x-6x^2). - Philippe Deléham, Nov 19 2008
Theorem: a(n) = 6*a(n-1) + 6*a(n-2) for n >= 2. Proved using the PtoRv program of Ekhad-Sloane-Zeilberger, and implies the above conjectures. - N. J. A. Sloane, Sep 09 2016
|
|
MATHEMATICA
|
a[0] = 8; a[1] = 55; a[n_] := a[n] = Floor[a[n - 1]^2/a[n - 2] + 1/2]; Table[a[n], {n, 0, 20}] (* Michael De Vlieger, Jul 27 2016 *)
LinearRecurrence[{6, 6}, {8, 55}, 30] (* Harvey P. Dale, Mar 06 2022 *)
|
|
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
}
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|