This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A166150 #35 Mar 17 2024 02:13:04
%S A166150 1,21,51,91,141,201,271,351,441,541,651,771,901,1041,1191,1351,1521,
%T A166150 1701,1891,2091,2301,2521,2751,2991,3241,3501,3771,4051,4341,4641,
%U A166150 4951,5271,5601,5941,6291,6651,7021,7401,7791,8191,8601,9021,9451,9891,10341
%N A166150 a(n) = 5*n^2 + 5*n - 9.
%C A166150 First differences are in A008592.
%H A166150 Vincenzo Librandi, <a href="/A166150/b166150.txt">Table of n, a(n) for n = 1..1000</a>
%H A166150 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F A166150 a(n) = a(n-1) + 10*n (with a(1)=1).
%F A166150 G.f.: x*(1+18*x-9*x^2)/(1-x)^3. - _Vincenzo Librandi_, Sep 13 2013
%F A166150 From _G. C. Greubel_, May 01 2016: (Start)
%F A166150 a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
%F A166150 E.g.f.: (5*x^2 + 10*x - 9)*exp(x) + 9. (End)
%F A166150 Sum_{n>=1} 1/a(n) = 1/9 + (Pi/sqrt(205))*tan(sqrt(41/5)*Pi/2). - _Amiram Eldar_, Feb 20 2023
%p A166150 A166150:=n->5*n^2+5*n-9: seq(A166150(n), n=1..100); # _Wesley Ivan Hurt_, May 01 2016
%t A166150 Table[(5 n^2 + 5 n - 9), {n, 50}] (* or *) CoefficientList[Series[(1 + 18 x - 9 x^2)/(1 - x)^3, {x, 0, 45}], x] (* _Vincenzo Librandi_, Sep 13 2013 *)
%t A166150 LinearRecurrence[{3,-3,1},{1,21,51}, 50] (* _G. C. Greubel_, May 01 2016 *)
%o A166150 (PARI) a(n)=5*n*(n+1)-9 \\ _Charles R Greathouse IV_, Jan 11 2012
%o A166150 (Magma) [5*n^2+5*n-9: n in [1..45]]; // _Vincenzo Librandi_, Sep 13 2013
%Y A166150 Cf. A008592.
%K A166150 nonn,easy
%O A166150 1,2
%A A166150 _Vincenzo Librandi_, Oct 08 2009
%E A166150 a(29)-a(45) corrected by _Charles R Greathouse IV_, Jan 11 2012
%E A166150 New name from _Charles R Greathouse IV_, Jan 11 2012