login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A359994
Independence number of the 2-Fibonacci digraph of order n.
3
1, 1, 2, 3, 6, 9, 16, 25, 44, 67, 115
OFFSET
1,3
COMMENTS
See Dalfó and Fiol (2019) or A360000 for the definition of the 2-Fibonacci graph.
a(12) >= 179. - Pontus von Brömssen, Nov 12 2023
LINKS
C. Dalfó and M. A. Fiol, On d-Fibonacci digraphs, arXiv:1909.06766 [math.CO], 2019.
PROG
(Python)
import networkx as nx
def F(n): return nx.DiGraph(((0, 0), (0, 1), (1, 0))) if n == 1 else nx.line_graph(F(n-1))
def A359994(n): return nx.max_weight_clique(nx.complement(nx.Graph(F(n))), weight=None)[1]
CROSSREFS
KEYWORD
nonn,more
AUTHOR
STATUS
approved