|
%I #18 Sep 10 2016 08:52:52
%S 8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,
%T 31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,
%U 54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80
%N a(n) = n + 8.
%C Pisot sequences E(8,9), P(8,9), T(8,9).
%D Shalosh B. Ekhad, N. J. A. Sloane and Doron Zeilberger, Automated Proof (or Disproof) of Linear Recurrences Satisfied by Pisot Sequences, Preprint, 2016.
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F a(n) = n+8.
%F a(n) = 2*a(n-1) - a(n-2).
%t Range[0,80]+8 (* or *) LinearRecurrence[{2,-1},{8,9},80] (* _Harvey P. Dale_, Jun 06 2015 *)
%o (PARI) a(n)=n+8
%Y See A008776 for definitions of Pisot sequences.
%K nonn,easy
%O 0,1
%A _David W. Wilson_
|
