# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a042513 Showing 1-1 of 1 %I A042513 #39 Jan 05 2025 19:51:35 %S A042513 1,56,3137,175728,9843905,551434408,30890170753,1730400996576, %T A042513 96933345979009,5429997775821080,304176808791959489, %U A042513 17039331290125552464,954506729055822897473,53469416158416207810952,2995241811600363460310785,167787010865778769985214912 %N A042513 Denominators of continued fraction convergents to sqrt(785). %C A042513 From _Michael A. Allen_, Dec 17 2023: (Start) %C A042513 Also called the 56-metallonacci sequence; the g.f. 1/(1-k*x-x^2) gives the k-metallonacci sequence. %C A042513 a(n) is the number of tilings of an n-board (a board with dimensions n X 1) using unit squares and dominoes (with dimensions 2 X 1) if there are 56 kinds of squares available. (End) %H A042513 Vincenzo Librandi, Table of n, a(n) for n = 0..200 %H A042513 Michael A. Allen and Kenneth Edwards, Fence tiling derived identities involving the metallonacci numbers squared or cubed, Fib. Q. 60:5 (2022) 5-17. %H A042513 Tanya Khovanova, Recursive Sequences %H A042513 Index entries for linear recurrences with constant coefficients, signature (56,1). %F A042513 a(n) = F(n, 56), the n-th Fibonacci polynomial evaluated at x=56. - _T. D. Noe_, Jan 19 2006 %F A042513 From _Philippe Deléham_, Nov 23 2008: (Start) %F A042513 a(n) = 56*a(n-1) + a(n-2) for n > 1, a(0)=1, a(1)=56. %F A042513 G.f.: 1/(1 - 56*x - x^2). (End) %t A042513 a=0; lst={}; s=0; Do[a = s-(a-1); AppendTo[lst, a]; s+=a*56, {n, 3*4!}]; lst (* _Vladimir Joseph Stephan Orlovsky_, Nov 03 2009 *) %t A042513 Denominator[Convergents[Sqrt[785], 30]] (* _Harvey P. Dale_, Jun 26 2012 *) %t A042513 CoefficientList[Series[1/(1 - 56 x - x^2), {x, 0, 25}], x] (* _Vincenzo Librandi_, Jan 23 2014 *) %Y A042513 Cf. A042512, A040756. %Y A042513 Row n=56 of A073133, A172236 and A352361 and column k=56 of A157103. %K A042513 nonn,frac,easy %O A042513 0,2 %A A042513 _N. J. A. Sloane_ %E A042513 Additional term from _Colin Barker_, Dec 17 2013 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE