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 A119697 #11 May 05 2023 01:37:57
%S A119697 0,1,4,30,168,1050,6336,39039,240240,1487772,9237800,57551494,
%T A119697 359444736,2250244100,14115694320,88707831750,558368324640,
%U A119697 3519726403710,22215931214400,140389620550410,888125492826000,5623962934819320,35645449061816880,226114365012465150
%N A119697 a(n) = Fibonacci(n)*n*binomial(2*n,n)/(n+1).
%F A119697 a(n) = n * A119694(n).
%F A119697 Sum_{n>=0} a(n)/8^n = 7*sqrt(2/5) - 4. - _Amiram Eldar_, May 04 2023
%p A119697 seq(binomial(2*n, n)*n*combinat[fibonacci](n)/(n+1), n=0..27);
%t A119697 Table[Fibonacci[n]n Binomial[2n,n]/(n+1),{n,0,40}] (* _Harvey P. Dale_, Apr 29 2022 *)
%Y A119697 Cf. A000045, A000984, A119694.
%K A119697 easy,nonn
%O A119697 0,3
%A A119697 _Zerinvary Lajos_, Jun 09 2006