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 A216786 #20 Aug 17 2025 03:49:58
%S A216786 1,110,12705,1490720,176277640,20941783632,2495562549480,
%T A216786 298041470195040,35653210872081660,4270462368900447720,
%U A216786 512028438031163681628,61443412563739641795360,7378329792029068652259480,886534702703800402679177520,106574136046464005550646840440
%N A216786 a(n) = Product_{k=1..n} (121 - 11/k).
%C A216786 This sequence is generalizable: Product_{k=1..n} (q^2 - q/k) = (q^n/n!) * Product_{k=0..n-1} (q*k + q-1) = expansion of (1- x*q^2)^((1-q)/q).
%F A216786 From _Amiram Eldar_, Aug 17 2025: (Start)
%F A216786 a(n) = 121^n * Gamma(n+10/11) / (Gamma(10/11) * Gamma(n+1)).
%F A216786 a(n) ~ c * 121^n / n^(1/11), where c = 1/Gamma(10/11) = 0.942148... . (End)
%p A216786 seq(product(121-11/k, k=1.. n), n=0..20);
%p A216786 seq((11^n/n!)*product(11*k+10, k=0.. n-1), n=0..20);
%p A216786 A216786 := proc(n)
%p A216786 binomial(-10/11,n)*(-121)^n ;
%p A216786 end proc: # _R. J. Mathar_, Sep 17 2012
%t A216786 Join[{1},FoldList[Times,121-11/Range[20]]] (* _Harvey P. Dale_, Mar 15 2016 *)
%Y A216786 Cf. A004988, A049382, A004994, A216702, A216703, A216704, A216705, A216706.
%K A216786 nonn
%O A216786 0,2
%A A216786 _Michel Lagneau_, Sep 16 2012