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 A359995 #5 Jan 22 2023 08:40:20 %S A359995 2,3,4,10,32,184,5110,681454 %N A359995 Number of maximal independent sets in the 2-Fibonacci digraph of order n. %C A359995 See Dalfó and Fiol (2019) or A360000 for the definition of the 2-Fibonacci graph. %C A359995 The loop at node 0 is disregarded, so 0 is allowed in the independent sets. %H A359995 C. Dalfó and M. A. Fiol, <a href="https://arxiv.org/abs/1909.06766">On d-Fibonacci digraphs</a>, arXiv:1909.06766 [math.CO], 2019. %o A359995 (Python) %o A359995 import networkx as nx %o A359995 def F(n): return nx.DiGraph(((0,0),(0,1),(1,0))) if n == 1 else nx.line_graph(F(n-1)) %o A359995 def A359995(n): return sum(1 for c in nx.find_cliques(nx.complement(nx.Graph(F(n))))) %Y A359995 Cf. A333077, A359994, A359996, A360000. %K A359995 nonn,more %O A359995 1,1 %A A359995 _Pontus von Brömssen_, Jan 21 2023