login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

a(n) = n + 5.
0

%I #21 Dec 07 2024 07:49:02

%S 5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,

%T 29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,

%U 52,53,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

%N a(n) = n + 5.

%C Pisot sequences E(5,6), P(5,6), T(5,6).

%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 + 5.

%F a(n) = 2*a(n-1) - a(n-2).

%F From _Elmo R. Oliveira_, Dec 06 2024: (Start)

%F G.f.: (5 - 4*x)/(1 - x)^2.

%F E.g.f.: (5 + x)*exp(x). (End)

%t Range[0,80]+5 (* _Harvey P. Dale_, Oct 12 2016 *)

%o (PARI) a(n)=n+5

%Y See A008776 for definitions of Pisot sequences.

%K nonn,easy

%O 0,1

%A _David W. Wilson_