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 A006479 M3880 #32 Mar 27 2025 08:19:31 %S A006479 0,0,0,1,5,18,52,134,318,713,1531,3180,6432,12732,24756,47417,89665, %T A006479 167694,310628,570562,1040226,1883953,3391799,6073848,10824096, %U A006479 19204536,33936456 %N A006479 From variance of Fibonacci search. %D A006479 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A006479 K. J. Overholt, <a href="http://dx.doi.org/10.1007/BF01933527">Efficiency of the Fibonacci search method</a>, Nordisk Tidskr. Informationsbehandling (BIT) 13 (1973), 92-96. %H A006479 Simon Plouffe, <a href="https://arxiv.org/abs/0911.4975">Approximations de séries génératrices et quelques conjectures</a>, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009. %H A006479 Simon Plouffe, <a href="/A000051/a000051_2.pdf">1031 Generating Functions</a>, Appendix to Thesis, Montreal, 1992 %H A006479 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (4,-3,-5,5,3,-2,-1). %F A006479 (Conjecture equivalent to Plouffe g.f.): a(n) = -3 - 2*A001629(n+2) - 3*A001629(n+1) + 2*A001628(n-1) + A020701(n+1). - _R. J. Mathar_, Dec 06 2010 %p A006479 A006479:=z**3*(1+z+z**2)/(z-1)/(z**2+z-1)**3; # conjectured by _Simon Plouffe_ in his 1992 dissertation %Y A006479 Cf. A006478. %K A006479 nonn,nice,more %O A006479 0,5 %A A006479 _N. J. A. Sloane_