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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A167585 a(n) = 12*n^2 - 8*n + 9. 3

%I #14 Jun 17 2017 04:38:04

%S 13,41,93,169,269,393,541,713,909,1129,1373,1641,1933,2249,2589,2953,

%T 3341,3753,4189,4649,5133,5641,6173,6729,7309,7913,8541,9193,9869,

%U 10569,11293,12041,12813,13609,14429,15273,16141,17033,17949,18889

%N a(n) = 12*n^2 - 8*n + 9.

%C The third row of the ED4 array A167584.

%H G. C. Greubel, <a href="/A167585/b167585.txt">Table of n, a(n) for n = 1..1000</a>

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

%F GF(z) = (9*z^2 + 2*z + 13)/(1-z)^3.

%F a(n) = a(n-1) + 24*n - 20, with a(1)=13. - _Vincenzo Librandi_, Dec 03 2010

%F a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - _G. C. Greubel_, Jun 17 2016

%t LinearRecurrence[{3, -3, 1}, {13, 41, 93}, 100] (* _G. C. Greubel_, Jun 17 2016 *)

%o (PARI) a(n)=12*n^2-8*n+9 \\ _Charles R Greathouse IV_, Jun 17 2017

%K easy,nonn

%O 1,1

%A _Johannes W. Meijer_, Nov 10 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.

Last modified March 5 09:09 EST 2024. Contains 370545 sequences. (Running on oeis4.)