

A333346


Decimal expansion of ((11 + sqrt(85))/2)^(1/7).


2



1, 3, 9, 1, 6, 6, 4, 2, 8, 4, 1, 3, 9, 8, 8, 8, 5, 1, 0, 5, 7, 4, 5, 8, 1, 2, 3, 8, 4, 5, 7, 9, 3, 3, 0, 0, 9, 0, 0, 6, 0, 3, 5, 6, 6, 5, 7, 0, 0, 4, 5, 5, 0, 6, 8, 8, 8, 0, 1, 4, 7, 8, 4, 9, 7, 8, 4, 7, 4, 8, 0, 0, 4, 5, 3, 6, 8, 8, 9, 1, 0, 1, 1, 9, 9, 6, 9, 2, 2, 8, 1, 0, 2, 9, 6, 1, 6, 1, 4, 6, 8, 4, 7, 8, 3, 0, 5, 4
(list;
constant;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

Heuberger and Wagner consider the number of maximum matchings a tree of n vertices may have. They show that the largest number of maximum matchings (A333347) grows as O(1.3916...^n) where the power is the constant here. This arises in their tree forms since each 7vertex "C" part increases the number of matchings by a factor of matrix M=[8,3/5,3] (lemma 6.2). The larger eigenvalue of M is their lambda = A333345 and so a factor of lambda for each 7 vertices.


LINKS

Table of n, a(n) for n=1..108.
Clemens Heuberger and Stephan Wagner, The Number of Maximum Matchings in a Tree, Discrete Mathematics, volume 311, issue 21, November 2011, pages 25122542; arXiv preprint, arXiv:1011.6554 [math.CO], 2010.


EXAMPLE

1.39166428413...


MATHEMATICA

RealDigits[((11 + Sqrt[85])/2)^(1/7), 10, 100][[1]] (* Amiram Eldar, Mar 15 2020 *)


CROSSREFS

Sequence growing as this power: A333347.
Sequence in context: A113847 A119796 A154572 * A165141 A019817 A243526
Adjacent sequences: A333343 A333344 A333345 * A333347 A333348 A333349


KEYWORD

nonn,cons


AUTHOR

Kevin Ryde, Mar 15 2020


STATUS

approved



