cp's OEIS Frontend

A210728 a(n) = a(n-1) + a(n-2) + n + 2 with n>1, a(0)=1, a(1)=2.

%I A210728 #28 Aug 26 2024 19:35:12
%S A210728 1,2,7,14,27,48,83,140,233,384,629,1026,1669,2710,4395,7122,11535,
%T A210728 18676,30231,48928,79181,128132,207337,335494,542857,878378,1421263,
%U A210728 2299670,3720963,6020664,9741659,15762356,25504049,41266440,66770525,108037002,174807565
%N A210728 a(n) = a(n-1) + a(n-2) + n + 2 with n>1, a(0)=1, a(1)=2.
%H A210728 Bruno Berselli, <a href="/A210728/b210728.txt">Table of n, a(n) for n = 0..1000</a>
%H A210728 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2,-1,1).
%F A210728 G.f.: (1-x+3*x^2-2*x^3)/((1-x)^2*(1-x-x^2)). - _Bruno Berselli_, Jun 27 2012
%F A210728 a(n) = ((5+sqrt(5))*(1+sqrt(5))^(n+1)-(5-sqrt(5))*(1-sqrt(5))^(n+1))/(2^(n+1)*sqrt(5))-n-5. - _Bruno Berselli_, Jun 27 2012
%F A210728 a(n) = -n-5+A022112(n+1). _R. J. Mathar_, Jul 03 2012
%t A210728 RecurrenceTable[{a[0] == 1, a[1] == 2, a[n] == a[n - 1] + a[n - 2] + n + 2}, a, {n, 36}] (* _Bruno Berselli_, Jun 27 2012 *)
%t A210728 nxt[{n_,a_,b_}]:={n+1,b,a+b+n+3}; NestList[nxt,{1,1,2},40][[;;,2]] (* _Harvey P. Dale_, Aug 26 2024 *)
%Y A210728 Cf. A065220: a(n)=a(n-1)+a(n-2)+n-5, a(0)=1,a(1)=2 (except first 2 terms).
%Y A210728 Cf. A168043: a(n)=a(n-1)+a(n-2)+n-3, a(0)=1,a(1)=2 (except first 2 terms).
%Y A210728 Cf. A131269: a(n)=a(n-1)+a(n-2)+n-2, a(0)=1,a(1)=2.
%Y A210728 Cf. A000126: a(n)=a(n-1)+a(n-2)+n-1, a(0)=1,a(1)=2.
%Y A210728 Cf. A104161: a(n)=a(n-1)+a(n-2)+n,   a(0)=1,a(1)=2 (except the first term).
%Y A210728 Cf. A192969: a(n)=a(n-1)+a(n-2)+n+1, a(0)=1,a(1)=2.
%Y A210728 Cf. A210729: a(n)=a(n-1)+a(n-2)+n+3, a(0)=1,a(1)=2.
%K A210728 nonn,easy
%O A210728 0,2
%A A210728 _Alex Ratushnyak_, May 10 2012