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 #6 Jan 22 2023 08:40:27
%S 2,3,4,10,3,42,12,706
%N Number of maximum independent sets in the 2-Fibonacci digraph of order n.
%C See Dalfó and Fiol (2019) or A360000 for the definition of the 2-Fibonacci graph.
%C The loop at node 0 is disregarded, so 0 is allowed in the independent sets.
%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. A333078, A359994, A359995, A360000.
%K nonn,more
%O 1,1
%A _Pontus von Brömssen_, Jan 21 2023