login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A156719 a(n) = 144*n^2 - 127*n + 28. 1

%I #34 Sep 23 2022 23:58:58

%S 45,350,943,1824,2993,4450,6195,8228,10549,13158,16055,19240,22713,

%T 26474,30523,34860,39485,44398,49599,55088,60865,66930,73283,79924,

%U 86853,94070,101575,109368,117449,125818,134475,143420,152653

%N a(n) = 144*n^2 - 127*n + 28.

%C 576*a(n) + 1 = (288*n - 127)^2. - _Vincenzo Librandi_, Feb 09 2012

%C The continued fraction expansion of sqrt(a(n)) is [12n-6; {1, 2, 2, 2, 1, 24n-12}]. - _Magus K. Chu_, Sep 23 2022

%H Vincenzo Librandi, <a href="/A156719/b156719.txt">Table of n, a(n) for n = 1..10000</a>

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).

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

%F G.f.: x*(-45 - 215*x - 28*x^2)/(x-1)^3.

%t LinearRecurrence[{3,-3,1},{45,350,943},40]

%o (Magma) I:=[45, 350, 943]; [n le 3 select I[n] else 3*Self(n-1)-3*Self(n-2)+1*Self(n-3): n in [1..40]];

%o (PARI) a(n)=144*n^2-127*n+28 \\ _Charles R Greathouse IV_, Dec 23 2011

%K nonn,easy

%O 1,1

%A _Vincenzo Librandi_, Feb 15 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)