cp's OEIS Frontend

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.

A022286 a(n) = n*(29*n - 1)/2.

This page as a plain text file.
%I A022286 #21 Aug 24 2017 16:34:50
%S A022286 0,14,57,129,230,360,519,707,924,1170,1445,1749,2082,2444,2835,3255,
%T A022286 3704,4182,4689,5225,5790,6384,7007,7659,8340,9050,9789,10557,11354,
%U A022286 12180,13035,13919,14832,15774,16745
%N A022286 a(n) = n*(29*n - 1)/2.
%H A022286 G. C. Greubel, <a href="/A022286/b022286.txt">Table of n, a(n) for n = 0..5000</a>
%H A022286 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F A022286 a(n) = 29*n + a(n-1) - 15 for n>0, a(0)=0. - _Vincenzo Librandi_, Aug 04 2010
%F A022286 G.f.: x*(14 + 15*x)/(1 - x)^3. - _R. J. Mathar_, Aug 04 2016
%F A022286 a(n) = A000217(15*n-1) - A000217(14*n-1). - _Bruno Berselli_, Oct 14 2016
%F A022286 E.g.f.: (x/2)*(29*x + 28)*exp(x). - _G. C. Greubel_, Aug 24 2017
%t A022286 Table[n (29 n - 1)/2, {n, 0, 40}] (* _Bruno Berselli_, Oct 14 2016 *)
%o A022286 (PARI) a(n)=n*(29*n-1)/2 \\ _Charles R Greathouse IV_, Jun 17 2017
%Y A022286 Cf. A000217, A022287.
%Y A022286 Cf. similar sequences listed in A022288.
%K A022286 nonn,easy
%O A022286 0,2
%A A022286 _N. J. A. Sloane_