# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/
Search: id:a027693
Showing 1-1 of 1
%I A027693 #42 Oct 31 2024 15:28:59
%S A027693 8,10,14,20,28,38,50,64,80,98,118,140,164,190,218,248,280,314,350,388,
%T A027693 428,470,514,560,608,658,710,764,820,878,938,1000,1064,1130,1198,1268,
%U A027693 1340,1414,1490,1568,1648,1730,1814,1900,1988,2078,2170,2264,2360,2458,2558
%N A027693 a(n) = n^2 + n + 8.
%H A027693 Muniru A Asiru, Table of n, a(n) for n = 0..4000
%H A027693 Patrick De Geest, Palindromic Quasi_Over_Squares of the form n^2+(n+X).
%H A027693 Index entries for linear recurrences with constant coefficients, signature (3,-3,1).
%F A027693 a(n) = 2*n + a(n-1) (with a(0)=8). - _Vincenzo Librandi_, Aug 05 2010
%F A027693 From _Harvey P. Dale_, Dec 13 2011: (Start)
%F A027693 a(0)=8, a(1)=10, a(2)=14, a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
%F A027693 G.f.: (2*(7-4*x)*x-8)/(x-1)^3. (End)
%F A027693 Sum_{n>=0} 1/a(n) = Pi*tanh(Pi*sqrt(31)/2)/sqrt(31). - _Amiram Eldar_, Jan 17 2021
%F A027693 From _Elmo R. Oliveira_, Oct 31 2024: (Start)
%F A027693 E.g.f.: exp(x)*(8 + 2*x + x^2).
%F A027693 a(n) = 2*A145018(n+1). (End)
%p A027693 with(combinat): seq(fibonacci(3, n)+n+7, n=0..46); # _Zerinvary Lajos_, Jun 07 2008
%t A027693 f[n_]:=n^2+n+8;f[Range[0,100]] (* _Vladimir Joseph Stephan Orlovsky_, Mar 12 2011 *)
%t A027693 LinearRecurrence[{3,-3,1},{8,10,14},60] (* _Harvey P. Dale_, Dec 13 2011 *)
%o A027693 (PARI) a(n)=n^2+(n+8) \\ _Charles R Greathouse IV_, Jun 17 2017
%o A027693 (GAP) List([0..50],n->n^2+n+8); # _Muniru A Asiru_, Jul 15 2018
%Y A027693 Cf. A002061, A002378, A002522, A145018.
%K A027693 nonn,easy
%O A027693 0,1
%A A027693 _Patrick De Geest_
# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE