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 A020941 #21 Jan 05 2025 19:51:34
%S A020941 1,7,16,39,84,157,309,555,1042,1919,3338,6011,10713,18321,32228,54730,
%T A020941 95320,165177,278208,478807,803383,1374926,2346070,3917414,6656320,
%U A020941 11284381,18772741,31721202,52672252,88750072,149303520,247281057,415039507,695705846
%N A020941 Main diagonal of Wythoff array: w(n,n)=[ n*tau ]F(n+1)+(n-1)F(n), where tau=(1+sqrt(5))/2, F(n) = Fibonacci numbers.
%H A020941 Clark Kimberling, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/32-4/kimberling.pdf">The first column of an interspersion</a>, Fibonacci Quarterly 32 (1994), pp. 301-314.
%H A020941 Clark Kimberling, <a href="http://faculty.evansville.edu/ck6/integer/intersp.html">Interspersions</a>
%H A020941 N. J. A. Sloane, <a href="/classic.html#WYTH">Classic Sequences</a>
%t A020941 Table[Floor[n*GoldenRatio]Fibonacci[n+1]+(n-1)Fibonacci[n],{n,40}] (* _Harvey P. Dale_, Mar 09 2015 *)
%o A020941 (PARI) a(n) = floor(n*(1+sqrt(5))/2)*fibonacci(n+1) + (n-1)*fibonacci(n) \\ _Michel Marcus_, Mar 21 2013
%Y A020941 Cf. A000045, A001622, A035513.
%K A020941 nonn
%O A020941 1,2
%A A020941 _Clark Kimberling_
%E A020941 More terms from _Harvey P. Dale_, Mar 09 2015