|
Search: id:A061646
|
|
|
| A061646 |
|
a(-1) = 1, a(0) = 1, a(1) = 1; for n>1, a(n) = 2*a(n-1)+2*a(n-2)-a(n-3). |
|
+0 5
|
|
| 1, 1, 1, 3, 7, 19, 49, 129, 337, 883, 2311, 6051, 15841, 41473, 108577, 284259, 744199, 1948339, 5100817, 13354113, 34961521, 91530451, 239629831, 627359043, 1642447297, 4299982849, 11257501249, 29472520899, 77160061447
(list; graph; listen)
|
|
|
OFFSET
|
-1,4
|
|
|
COMMENT
|
Beginning at the well for the topograph of a positive definite quadratic form with values 1, 1, 1 at a superbase (i.e. 1, 1, and 1 are the vonorms of the superbase), these numbers indicate the values of the quadratic form at vectors adjacent to the path in the topograph of greatest rate of ascent of labels of the edges of the topograph.
For n>1, a_n is the number of domino tilings of the L-grid obtained by removing the upper-right (n-1)x(n-2) rectangle from a (n+1)xn rectangle; also, for n>1, (2*a_n)^2 is the number of domino tilings of the holey square obtained by removing the centered (n-2)x(n-2) square from a (n+2)x(n+2) square. - Roberto Tauraso, Jun 05 2004.
Let P = 3 X 3 Fibonacci matrix [ 0 0 1 / 0 1 2 / 1 1 1 ]. Then a(n) is the central term of P^n. - Gary W. Adamson (qntmpkt(AT)yahoo.com), May 13 2003
Coefficient of 1 when looking for the simplest linear dependence between (phi^(n-1)+fibonacci(n-1)) / (phi^n + fibonacci(n)) - 1/phi, 1 and phi. Thus a(n) is given by lindep([phi^(n-1)+fibonacci(n-1))/(phi^n+fibonacci(n))-1/phi,1,phi],80)[2] when using Pari-GP with enough digits of precision. - Thomas Baruchel (baruchel(AT)users.sourceforge.net), Nov 19 2004
a(n), n>=2, is twice the area of the plane triangle in three dimensional space with vertices (F(n-1),0,0), (0,F(n),0) and (0,0,F(n+1)). See the Atanassov et al. reference p. 88 (misprint in eq. (1.3): it should read F_{2n-1} not (F_{2n-1})^2). W. Lang (wolfdieter.lang_AT_physik_DOT_uni-karlsruhe_DOT_de), Jul 22 2005.
|
|
REFERENCES
|
J. H. Conway, The Sensual (Quadratic) Form, MAA.
Thomas Koshy, Fibonacci and Lucas Numbers with Applications, Wiley-Interscience, 2001; pages 383-384.
K. T. Atanassov, V. Atanassova, A. G. Shannon and J. C. Turner, New visual perspectives on Fibonacci numbers, World Scientific, 2002.
|
|
LINKS
|
Author?, Posting to sci.math.
Roberto Tauraso, A New Domino Tiling Sequence, Journal of Integer Sequences, Article 04.2.3 (2004).
Roberto Tauraso, A New Domino Tiling Sequence, Journal of Integer Sequences, Vol. 7 (2004), Article 04.2.3.
|
|
FORMULA
|
a(n) =Fib(n)^2+Fib(n)*Fib(n-1)+Fib(n-1)^2 =A007598(n+1)-A001654(n-1). Area of triangle with sides sqrt(a(n)), sqrt(a(n-1)), and sqrt(a(n-2)) is sqrt(3)/4, i.e. 2*(a(n)*a(n-1)+a(n)*a(n-2)+a(n-1)*a(n-2))-(a(n)^2+a(n-1)^2+a(n-2)^2)=3. - Henry Bottomley (se16(AT)btinternet.com), Jan 09 2003
a(n) = (2*fibonacci(n)*fibonacci(n+1)*(fibonacci(n+2)+phi*fibonacci(n+1))+(1/phi)^n)/(fibonacci(n)*phi+fibonacci(n+1)) - Thomas Baruchel (baruchel(AT)users.sourceforge.net), Nov 19 2004
a(n)= F(2*n-1) + F(n-1)*F(n), with F(-3):=2, F(-2):=-1 and F(-1):=1 (corrected eq. (1.3) of the Atanassov et al. reference) with F(n):=A000045 (Fibonacci). - W. Lang, Jul 22 2005
|
|
EXAMPLE
|
a(7)=337 since 2*a(6)+2*a(5)-a(4)=2*129+2*49-19=337
|
|
CROSSREFS
|
Adjacent sequences: A061643 A061644 A061645 this_sequence A061647 A061648 A061649
Sequence in context: A049117 A073063 A007288 this_sequence A017926 A017927 A116903
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Darrin Frey (freyd(AT)cedarville.edu), Jun 14 2001
|
|
|
Search completed in 0.002 seconds
|