This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A041221 #43 Jan 05 2025 19:51:35 %S A041221 1,22,485,10692,235709,5196290,114554089,2525386248,55673051545, %T A041221 1227332520238,27056988496781,596481079449420,13149640736384021, %U A041221 289888577279897882,6390698340894137425,140885252076950921232,3105866244033814404529,68469942620820867820870 %N A041221 Denominators of continued fraction convergents to sqrt(122). %C A041221 From _Michael A. Allen_, May 04 2023: (Start) %C A041221 Also called the 22-metallonacci sequence; the g.f. 1/(1-k*x-x^2) gives the k-metallonacci sequence. %C A041221 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 22 kinds of squares available. (End) %H A041221 Vincenzo Librandi, <a href="/A041221/b041221.txt">Table of n, a(n) for n = 0..200</a> %H A041221 Michael A. Allen and Kenneth Edwards, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Papers1/60-5/allen.pdf">Fence tiling derived identities involving the metallonacci numbers squared or cubed</a>, Fib. Q. 60:5 (2022) 5-17. %H A041221 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a> %H A041221 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (22,1). %F A041221 a(n) = F(n, 22), the n-th Fibonacci polynomial evaluated at x=22. - _T. D. Noe_, Jan 19 2006 %F A041221 From _Philippe Deléham_, Nov 21 2008: (Start) %F A041221 a(n) = 22*a(n-1) + a(n-2) for n > 1; a(0)=1, a(1)=22. %F A041221 G.f.: 1/(1 - 22*x - x^2). (End) %t A041221 Denominator[Convergents[Sqrt[122], 30]] (* _Vincenzo Librandi_, Dec 13 2013 *) %t A041221 Fibonacci[1+Range[0,30], 22] (* _G. C. Greubel_, Oct 25 2024 *) %o A041221 (Magma) %o A041221 [n le 2 select (22)^(n-1) else 22*Self(n-1)+Self(n-2): n in [1..31]]; // _G. C. Greubel_, Oct 25 2024 %o A041221 (SageMath) %o A041221 A041221=BinaryRecurrenceSequence(22,1,1,22) %o A041221 [A041221(n) for n in range(31)] # _G. C. Greubel_, Oct 25 2024 %Y A041221 Cf. A040110, A041220. %Y A041221 Row n=22 of A073133, A172236 and A352361 and column k=22 of A157103. %K A041221 nonn,frac,easy,less %O A041221 0,2 %A A041221 _N. J. A. Sloane_ %E A041221 More terms from _Colin Barker_, Nov 14 2013