The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A359994 Independence number of the 2-Fibonacci digraph of order n. 3
1, 1, 2, 3, 6, 9, 16, 25, 44, 67, 115 (list; graph; refs; listen; history; text; internal format)
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
Sequence in context: A301753 A275548 A260710 * A093830 A320268 A118033
KEYWORD
nonn,more
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 18 01:23 EDT 2024. Contains 372608 sequences. (Running on oeis4.)