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 A291573 #18 Feb 16 2025 08:33:50
%S A291573 2,2,5,14,73,1460,138536
%N A291573 Number of minimal dominating sets in the n-Fibonacci cube graph.
%C A291573 The size of the smallest set, the domination number, is given by A291295.
%H A291573 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/FibonacciCubeGraph.html">Fibonacci Cube Graph</a>
%H A291573 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimalDominatingSet.html">Minimal Dominating Set</a>
%H A291573 Wikipedia, <a href="https://en.wikipedia.org/wiki/Fibonacci_cube">Fibonacci cube</a>
%e A291573 Case n=1: The vertices are 0, 1. Each singleton vertex set is a minimal dominating set, so a(1) = 2.
%e A291573 Case n=2: The vertices are 00, 01, 10. Minimal dominating sets are {00} and {01, 10}, so a(2) = 2.
%e A291573 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 A291573 Cf. A291295, A291742.
%K A291573 nonn,more
%O A291573 1,1
%A A291573 _Andrew Howroyd_, Aug 30 2017