OFFSET
0,2
COMMENTS
Twice heptagonal numbers. - Omar E. Pol, May 14 2008
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
Lancelot Hogben, Choice and Chance by Cardpack and Chessboard, Vol. 1, Max Parrish and Co, London, 1950, p. 36.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).
FORMULA
Binomial transform of [2, 12, 10, 0, 0, 0, ...]. - Gary W. Adamson, Mar 05 2008
a(n) = 2*A000566(n). - Omar E. Pol, May 14 2008
a(n) = a(n-1) + 10*n - 8 (with a(0)=0). - Vincenzo Librandi, Nov 24 2010
a(n) = A131242(10n+1). - Philippe Deléham, Mar 27 2013
From G. C. Greubel, Oct 29 2016: (Start)
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
G.f.: 2*x*(1 + 4*x)/(1 - x)^3.
E.g.f.: x*(2 + 5*x)*exp(x). (End)
Sum_{n>=1} 1/a(n) = tan(Pi/10)*Pi/6 - sqrt(5)*log(phi)/6 + 5*log(5)/12, where phi is the golden ratio (A001622). - Amiram Eldar, Jul 19 2022
MATHEMATICA
LinearRecurrence[{3, -3, 1}, {0, 2, 14}, 50] (* or *) Table[n*(5*n-3), {n, 0, 50}] (* G. C. Greubel, Oct 29 2016 *)
PROG
(PARI) a(n)=n*(5*n-3) \\ Charles R Greathouse IV, Oct 07 2015
(Magma) [n*(5*n-3): n in [0..50]]; // G. C. Greubel, Jul 05 2019
(Sage) [n*(5*n-3) for n in (0..50)] # G. C. Greubel, Jul 05 2019
(GAP) List([0..50], n-> n*(5*n-3)) # G. C. Greubel, Jul 05 2019
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Mar 04 2008, Mar 05 2008
STATUS
approved