This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A291915 #11 Feb 16 2025 08:33:51
%S A291915 0,0,0,2,22,82,268,742,1902,4562,10452,23068,49432,103364,211764,
%T A291915 426354,845626,1655454,3203876,6137946,11652946,21944034,41021256,
%U A291915 76174360,140595760,258061160,471255240,856536610,1550048766,2793774026,5016560956,8976350894
%N A291915 Number of 6-cycles in the n-Fibonacci cube graph.
%H A291915 Michael De Vlieger, <a href="/A291915/b291915.txt">Table of n, a(n) for n = 1..4737</a>
%H A291915 Ömer Egecioglu, Elif Saygı, and Zülfükar Saygı, <a href="https://doi.org/10.1016/j.tcs.2021.04.019">The number of short cycles in Fibonacci cubes</a>, Theoretical Computer Science (2021) Vol. 871, 134-146.
%H A291915 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/FibonacciCubeGraph.html">Fibonacci Cube Graph</a>
%H A291915 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GraphCycle.html">Graph Cycle</a>
%H A291915 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (4,-2,-8,5,8,-2,-4,-1).
%F A291915 a(n) = 4*a(n-1) - 2*a(n-2) - 8*a(n-3) + 5*a(n-4) + 8*a(n-5) - 2*a(n-6) - 4*a(n-7) - a(n-8).
%t A291915 LinearRecurrence[{4, -2, -8, 5, 8, -2, -4, -1}, {0, 0, 0, 2, 22, 82, 268, 742}, 40]
%Y A291915 Cf. A001628 (4-cycles).
%K A291915 nonn,easy
%O A291915 1,4
%A A291915 _Eric W. Weisstein_, Sep 05 2017