|
%I #22 Sep 08 2022 08:45:51
%S 0,61,244,549,976,1525,2196,2989,3904,4941,6100,7381,8784,10309,11956,
%T 13725,15616,17629,19764,22021,24400,26901,29524,32269,35136,38125,
%U 41236,44469,47824,51301,54900,58621,62464,66429,70516,74725,79056
%N 61*n^2.
%H Vincenzo Librandi, <a href="/A174333/b174333.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) = (31*n)^2-(30*n)^2.
%F a(n) = 3*a(n-1) -3*a(n-2) +a(n-3). - _Vincenzo Librandi_, Jul 12 2012
%F G.f.: 61*x*(1+x)/(1-x)^3. - _Vincenzo Librandi_, Jul 12 2012
%t Table[61*n^2,{n,0,50}] (* _Vincenzo Librandi_, Jul 12 2012 *)
%t LinearRecurrence[{3,-3,1},{0,61,244},40] (* _Harvey P. Dale_, Apr 14 2022 *)
%o (Magma) [61*n^2: n in [0..50]];
%o (PARI) a(n)=61*n^2 \\ _Charles R Greathouse IV_, Jun 17 2017
%K nonn,easy
%O 0,2
%A _Vincenzo Librandi_, Mar 16 2010
%E Definition clarified by _R. J. Mathar_, Jul 06 2010
%E Comment rewritten as formula by _Bruno Berselli_, Jul 12 2012
|
