A306692 - OEIS

%I #12 Apr 11 2019 08:21:29

%S 1,2,2,4,4,8,9,16,19,32,41,64,85,128,177,256,361,512,737,1024,1489,

%T 2048,3009,4096,6049,8192,12161,16384,24385,32768,48897,65960,97921,

%U 134432,196097,272224,392449,551392,785409,1113808,1571329,2249920,3143681,4529600,6288385,9119680,12578817,18332576,25159681,36852608,50323457

%N The maximum number of minimal dominating sets in a tree with n vertices.

%C 0.64 < a(n)/95^(n/13) < 0.995 for all n.

%H G. Rote, <a href="https://doi.org/10.1137/1.9781611975482.73">The maximum number of minimal dominating sets in a tree</a>, Proc. 30th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA19), San Diego, Jan. 2019, pp. 1201-1214.

%K nonn

%O 1,2

%A _Günter Rote_, Mar 05 2019