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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A157855 103680000n^2 - 46108800n + 5126401. 3
 62697601, 327628801, 799920001, 1479571201, 2366582401, 3460953601, 4762684801, 6271776001, 7988227201, 9912038401, 12043209601, 14381740801, 16927632001, 19680883201, 22641494401, 25809465601, 29184796801, 32767488001 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The identity (103680000*n^2-46108800*n+5126401)^2-(3600*n^2-1601*n +178)*(1728000*n-384240)^2=1 can be written as a(n)^2-A157853(n)*A157854(n)^2=1. LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..10000 Index entries for linear recurrences with constant coefficients, signature (3,-3,1). FORMULA a(n) = 3*a(n-1) -3*a(n-2) +a(n-3). G.f.: x*(-62697601-139535998*x-5126401*x^2)/(x-1)^3. MATHEMATICA LinearRecurrence[{3, -3, 1}, {62697601, 327628801, 799920001}, 40] PROG (Magma) I:=[62697601, 327628801, 799920001]; [n le 3 select I[n] else 3*Self(n-1)-3*Self(n-2)+1*Self(n-3): n in [1..40]]; (PARI) a(n) = 103680000*n^2 - 46108800*n + 5126401. CROSSREFS Cf. A157853, A157854. Sequence in context: A205658 A206187 A205369 * A017539 A227150 A186140 Adjacent sequences: A157852 A157853 A157854 * A157856 A157857 A157858 KEYWORD nonn,easy AUTHOR Vincenzo Librandi, Mar 08 2009 STATUS approved

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.

Last modified December 5 10:03 EST 2022. Contains 358585 sequences. (Running on oeis4.)