OFFSET
0,1
REFERENCES
Shalosh B. Ekhad, N. J. A. Sloane and Doron Zeilberger, Automated Proof (or Disproof) of Linear Recurrences Satisfied by Pisot Sequences, Preprint, 2016.
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
Dominika Závacká, Cristina Dalfó, and Miquel Angel Fiol, Integer sequences from k-iterated line digraphs, CEUR: Proc. 24th Conf. Info. Tech. - Appl. and Theory (ITAT 2024) Vol 3792, 156-161. See p. 161, Table 2.
Index entries for linear recurrences with constant coefficients, signature (2,0,-1).
FORMULA
a(n) = Fibonacci(n+5)+1 = A001611(n+5).
a(n) = 2*a(n-1) - a(n-3).
a(n) = A020706(n+1). - R. J. Mathar, Oct 25 2008
MATHEMATICA
Table[Fibonacci[n + 5] + 1, {n, 0, 36}] (* Michael De Vlieger, Jul 27 2016 *)
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(50, 6, 9) \\ Colin Barker, Jul 27 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved