OFFSET
0,2
COMMENTS
a(m) where m is a positive integer are the only positive integer values of t for which the Binet-de Moivre Formula of the recurrence b(n) = 8*b(n-1) + t*b(n-2) with b(0) = 0 and b(1) = 1 has a root which is a square. In particular, sqrt(8^2 + 4*t) is a positive integer since 8^2 + 4*t = 8^2 + 4*a(m) = (2*m + 8)^2. Thus, the characteristics roots are r1 = 8 + m and r2 = -m. - Felix P. Muga II, Mar 28 2014
LINKS
Shawn A. Broyles, Table of n, a(n) for n = 0..1000
Patrick De Geest, Palindromic Quasipronics of the form n(n+x).
Felix Pozon Muga II, Extending the Golden Ratio and the Binet-de Moivre Formula, Preprint on ResearchGate, March 2014.
Wikipedia, Hydrogen spectral series.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).
FORMULA
a(n) = (n+4)^2 - 4^2 = n*(n+8), n >= 0.
G.f.: x*(9 - 7*x)/(1 - x)^3.
a(n) = 2*n + a(n-1) + 7. - Vincenzo Librandi, Aug 05 2010
Sum_{n >= 1} 1/a(n) = 761/2240 = 0.3397321... - R. J. Mathar, Mar 22 2011
Sum_{n>=1} (-1)^(n+1)/a(n) = 533/6720. - Amiram Eldar, Jan 15 2021
E.g.f.: x*(9 + x)*exp(x). - G. C. Greubel, Jul 31 2022
From Amiram Eldar, Feb 12 2024: (Start)
Product_{n>=1} (1 - 1/a(n)) = 315*sin(sqrt(17)*Pi)/(13*sqrt(17)*Pi).
Product_{n>=1} (1 + 1/a(n)) = -32*sqrt(15)*sin(sqrt(15)*Pi)/(11*Pi). (End)
MATHEMATICA
Table[n (n+8), {n, 0, 50}] (* Bruno Berselli, Apr 06 2014 *)
PROG
(PARI) a(n)=n*(n+8)
(Sage) [n*(n+8) for n in [0..50]] # Bruno Berselli, Apr 06 2014
(Scala) (0 to 49).map { n: Int => n * n + 8 * n } // Alonso del Arte, Nov 10 2019
(Magma) [n*(n+8): n in [0..50]]; // G. C. Greubel, Jul 31 2022
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved