The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A113772 Determinant of the 2 X 2 matrices where the first column is consecutive triangular numbers and the second column is the corresponding consecutive Fibonacci numbers. 1
-2, 0, -2, 5, 15, 49, 120, 279, 605, 1265, 2562, 5070, 9842, 18810, 35480, 66181, 122265, 223991, 407340, 735945, 1321903, 2361985, 4200468, 7437900, 13118950, 23056164, 40386850, 70529189, 122820915, 213323245, 369611232, 638945835, 1102195697, 1897522865 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
LINKS
FORMULA
a(n) = t(n-1)*f(n) - t(n)*f(n-1), where t(n) = n(n+1)/2 and f(n) = f(n-1) + f(n-2) with f(1)=f(2)=1.
From Chai Wah Wu, May 29 2016: (Start)
a(n) = 3*a(n-1) - 5*a(n-3) + 3*a(n-5) + a(n-6) for n>7.
G.f.: x^2*(2 - 6*x + 2*x^2 - x^3)/(x^2 + x - 1)^3. (End)
EXAMPLE
a(5) = t(4)*f(5)-t(5)*f(4) = 10*5-15*3 = 50-45 = 5.
MATHEMATICA
LinearRecurrence[{3, 0, -5, 0, 3, 1}, {-2, 0, -2, 5, 15, 49}, 50] (* G. C. Greubel, May 29 2016 *)
PROG
(PARI) t(n) = n*(n+1)/2 \\ A000217
f(n) = if (n==1, 1, if (n==2, 1, f(n-1)+f(n-2))) \\ A000045
det(n) = t(n-1)*f(n)-t(n)*f(n-1) \\ Michel Marcus, Jun 19 2013
CROSSREFS
Sequence in context: A243159 A339327 A258144 * A033716 A115978 A033751
KEYWORD
easy,sign
AUTHOR
Patrick J. Costello (pat.costello(AT)eku.edu), Jan 19 2006
EXTENSIONS
More terms from Michel Marcus, Jun 19 2013
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 6 16:59 EDT 2024. Contains 373133 sequences. (Running on oeis4.)