OFFSET
0,2
COMMENTS
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..5000
Amelia Carolina Sparavigna, The groupoid of the Triangular Numbers and the generation of related integer sequences, Politecnico di Torino, Italy (2019).
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).
FORMULA
a(n) = 8*n^2 + 3*n.
Sequences of the form a(n)=8*n^2+c*n have generating functions x{c+8+(8-c)x} / (1-x)^3 and recurrence a(n)= 3a(n-1)-3a(n-2)+a(n-3). The inverse binomial transform is 0, c+8, 16, 0, 0, ... (0 continued). This applies to A139271-A139278, positive or negative c. - R. J. Mathar, May 12 2008
a(n) = 16*n+a(n-1)-5 (with a(0)=0). - Vincenzo Librandi, Aug 03 2010
From G. C. Greubel, Jul 18 2017: (Start)
G.f.: x*(5*x + 11)/(1-x)^3.
E.g.f.: (8*x^2 + 11*x)*exp(x). (End)
Sum_{n>=1} 1/a(n) = 8/9 - (sqrt(2)-1)*Pi/6 - 4*log(2)/3 + sqrt(2)*log(sqrt(2)+1)/3. - Amiram Eldar, Mar 17 2022
EXAMPLE
a(1)=16*1+0-5=11; a(2)=16*2+11-5=38; a(3)=16*3+38-5=81. - Vincenzo Librandi, Aug 03 2010
MATHEMATICA
a[n_]:=n*(8*n+3); a[Range[0, 60]] (* Vladimir Joseph Stephan Orlovsky, Feb 05 2011*)
LinearRecurrence[{3, -3, 1}, {0, 11, 38}, 50] (* Harvey P. Dale, Jul 02 2022 *)
PROG
(PARI) a(n)=n*(8*n+3) \\ Charles R Greathouse IV, Jun 16 2017
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Omar E. Pol, Apr 26 2008
STATUS
approved