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!)
A174334 73*n^2. 1

%I #15 Sep 08 2022 08:45:51

%S 0,73,292,657,1168,1825,2628,3577,4672,5913,7300,8833,10512,12337,

%T 14308,16425,18688,21097,23652,26353,29200,32193,35332,38617,42048,

%U 45625,49348,53217,57232,61393,65700,70153,74752,79497,84388,89425,94608

%N 73*n^2.

%H Vincenzo Librandi, <a href="/A174334/b174334.txt">Table of n, a(n) for n = 0..1000</a>

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

%F a(n) = (37*n)^2-(36*n)^2.

%F G.f.: 73*x*(1 + x)/(1 - x)^3. - _Vincenzo Librandi_, Aug 21 2014

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

%t Table[73 n^2, {n, 0, 40}] (* or *) CoefficientList[Series[73 x (1 + x)/(1 - x)^3, {x, 0, 40}], x] (* _Vincenzo Librandi_, Aug 21 2014 *)

%o (Magma) [73*n^2: n in [0..50]];

%o (Magma) I:=[0,73,292]; [n le 3 select I[n] else 3*Self(n-1)-3*Self(n-2)+Self(n-3): n in [1..40]]; // _Vincenzo Librandi_, Aug 21 2014

%o (PARI) a(n)=73*n^2 \\ _Charles R Greathouse IV_, Jun 17 2017

%K nonn,easy

%O 0,2

%A _Vincenzo Librandi_, Mar 16 2010

%E Comment rewritten as formula by _Bruno Berselli_, Jul 12 2012

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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)