%I #17 Sep 03 2017 07:50:27
%S 2,2,5,14,73,1460,138536
%N Number of minimal dominating sets in the n-Fibonacci cube graph.
%C The size of the smallest set, the domination number, is given by A291295.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/FibonacciCubeGraph.html">Fibonacci Cube Graph</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MinimalDominatingSet.html">Minimal Dominating Set</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Fibonacci_cube">Fibonacci cube</a>
%e Case n=1: The vertices are 0, 1. Each singleton vertex set is a minimal dominating set, so a(1) = 2.
%e Case n=2: The vertices are 00, 01, 10. Minimal dominating sets are {00} and {01, 10}, so a(2) = 2.
%e Case n=3: The vertices are 000, 001, 010, 100, 101. Minimal dominating sets are {000, 001}, {000, 100}, {000, 101}, {010, 101}, {001, 010, 100}, so a(3)=5.
%Y Cf. A291295, A291742.
%K nonn,more
%O 1,1
%A _Andrew Howroyd_, Aug 30 2017