|
%I #20 Sep 08 2022 08:44:41
%S 9,121,361,729,1225,1849,2601,3481,4489,5625,6889,8281,9801,11449,
%T 13225,15129,17161,19321,21609,24025,26569,29241,32041,34969,38025,
%U 41209,44521,47961,51529,55225,59049,63001,67081,71289,75625,80089,84681
%N a(n) = (8n + 3)^2.
%H Vincenzo Librandi, <a href="/A017102/b017102.txt">Table of n, a(n) for n = 0..2000</a>
%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3, -3, 1).
%F a(0)=9, a(1)=121, a(2)=361, a(n)=3*a(n-1)-3*a(n-2)+a(n-3). - _Harvey P. Dale_, Feb 23 2014
%t Table[(8n + 3)^2, {n, 0, 40}] (* _Stefan Steinerberger_, Apr 08 2006 *)
%t LinearRecurrence[{3,-3,1},{9,121,361},40] (* _Harvey P. Dale_, Feb 23 2014 *)
%o (Magma) [(8*n+3)^2: n in [0..40]]; // _Vincenzo Librandi_, Jun 07 2011
%o (PARI) a(n)=(8*n+3)^2 \\ _Charles R Greathouse IV_, Jun 17 2017
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_
%E More terms from _Stefan Steinerberger_, Apr 08 2006
|
