cp's OEIS Frontend

The 2-Fibonacci digraph of order n, F(n), is defined by Dalfó and Fiol (2019). It can be defined as an iterated line digraph, where F(1) has two nodes, one directed edge in each direction between them, and a loop at one of the nodes, and for n >= 2 F(n) is the line digraph of F(n-1). (Compare the related de Bruijn graph, where the graph of order one has loops at both nodes.) Its nodes can be identified with binary sequences of length n with no adjacent 1's (or fibbinary numbers below 2^n if the nodes are labeled by integers instead of binary sequences), with a directed edge from (x_0, ..., x_{n-1}) to (x_1, ..., x_n) if there are no consecutive 1's in (x_0, ..., x_n). For n >= 2, it is also the subgraph of the de Bruijn graph (of the same order) induced by the nodes with no adjacent 1's. It has A000045(n+2) nodes and A000045(n+3) edges.

Equivalently, a(n) is the number of cycles with no adjacent 1's that can be produced by a general n-stage feedback shift register.

See Dalfó and Fiol (2019) or A360000 for the definition of the 2-Fibonacci digraph.

The longest cycles appear to have length A080023(n).

See Dalfó and Fiol (2019) or A360000 for the definition of the 2-Fibonacci graph.