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”).
%I #9 Jan 24 2023 17:42:51
%S 1,1,1,1,2,2,28,216,65200,167084480
%N Number of longest directed cycles in the 2-Fibonacci digraph of order n.
%C See Dalfó and Fiol (2019) or A360000 for the definition of the 2-Fibonacci digraph.
%C The longest cycles appear to have length A080023(n).
%H 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.
%Y Cf. A016031, A080023, A359997, A360000.
%K nonn,more
%O 1,5
%A _Pontus von Brömssen_, Jan 21 2023
%E a(10) from _Bert Dobbelaere_, Jan 24 2023