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 A333345 #34 Feb 11 2025 14:25:55
%S A333345 1,0,1,0,9,7,7,2,2,2,8,6,4,6,4,4,3,6,5,5,0,0,1,1,3,7,1,4,0,8,8,1,3,9,
%T A333345 6,5,7,8,6,2,3,4,0,2,5,2,4,3,6,1,2,3,2,0,0,4,0,0,3,8,7,6,1,0,2,7,2,1,
%U A333345 3,3,5,5,1,3,4,0,0,9,3,7,7,3,0,3,8,3,9,4,7,0,4,5,3,9,6,6,4,0,2,8,2,4,7,0,1,6,9,9
%N A333345 Decimal expansion of (11 + sqrt(85))/2.
%C A333345 This constant is Heuberger and Wagner's lambda. They consider the number of maximum matchings a tree of n vertices may have, and show that the largest number of maximum matchings (A333347) grows as O(lambda^(n/7)) (see A333346 for the 7th root). Lambda is the larger eigenvalue of matrix M = [8,3/5,3] which is raised to a power when counting matchings in a chain of "C" parts in the trees (their lemma 6.2).
%C A333345 Apart from the first digit the same as A176522. - _R. J. Mathar_, Apr 03 2020
%H A333345 Clemens Heuberger and Stephan Wagner, <a href="https://doi.org/10.1016/j.disc.2011.07.028">The Number of Maximum Matchings in a Tree</a>, Discrete Mathematics, volume 311, issue 21, November 2011, pages 2512-2542; <a href="https://arxiv.org/abs/1011.6554">arXiv preprint</a>, arXiv:1011.6554 [math.CO], 2010.
%H A333345 <a href="/index/Al#algebraic_02">Index entries for algebraic numbers, degree 2</a>.
%F A333345 Equals continued fraction [10; 9] = 10 + 1/(9 + 1/(9 + 1/(9 + 1/...))). - _Peter Luschny_, Mar 15 2020
%e A333345 10.1097722286...
%t A333345 With[{$MaxExtraPrecision = 1000}, First@ RealDigits[(11 + Sqrt[85])/2, 10, 105]] (* _Michael De Vlieger_, Mar 15 2020 *)
%o A333345 (PARI) (11 + sqrt(85))/2 \\ _Michel Marcus_, May 21 2020
%Y A333345 Sequences growing as this power: A147841, A190872, A333344.
%Y A333345 Cf. A333346 (seventh root), A176522.
%K A333345 cons,nonn
%O A333345 2,5
%A A333345 _Kevin Ryde_, Mar 15 2020