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 A343831 #25 May 01 2021 08:21:18 %S A343831 1,3,120,2520,51840,2494800,6227020800,653837184000,27360571392000, %T A343831 30411275102208000,51090942171709440000,1846572624206069760000, %U A343831 15511210043330985984000000,1361108681302294020096000000,8841761993739701954543616000000 %N A343831 a(n) = denominator of (1/e) * Sum_{a_1>=1, a_2>=1, ... , a_n>=1} a_1 * a_2 * ... * a_n / (a_1 + a_2 + ... + a_n)!. %D A343831 O. Furdui, Limits, Series and Fractional Part Integrals. Problems in Mathematical Analysis, Springer, New York, 2013. See Problem 3.114 and 3.118. %H A343831 Seiichi Manyama, <a href="/A343831/b343831.txt">Table of n, a(n) for n = 1..225</a> %H A343831 Math StackExchange, <a href="https://math.stackexchange.com/questions/2344699/compute-s-n-sum-limits-a-1-a-2-cdots-a-n-1-infty-fraca-1a-2-cdots-a-n?rq=1">Compute S_n = Sum_{a_1 a_2 ... a_n >=1} a_1 a_2 ... a_n/(a_1+a_2+...+a_n)!</a> %F A343831 b(n) = (1/e) * Sum_{a_1>=1, a_2>=1, ... , a_n>=1} a_1 * a_2 * ... * a_n / (a_1 + a_2 + ... + a_n)! = Sum_{j=0..n} (-1)^(n+j-1) * binomial(n,j) * Sum_{k=0..n+j-1} (-1)^k/k! = Sum_{k=0..n-1} binomial(n-1,k)/(k+n)!. %F A343831 a(n) = denominator of b(n). %e A343831 1, 2/3, 31/120, 179/2520, 787/51840, 6631/2494800, 2456299/6227020800, ... %t A343831 a[n_] := Denominator @ Sum[Binomial[n - 1, k]/(k + n)!, {k, 0, n - 1}]; Array[a, 20] (* _Amiram Eldar_, May 01 2021 *) %o A343831 (PARI) a(n) = denominator(sum(j=0, n, (-1)^(n+j-1)*binomial(n, j)*sum(k=0, n+j-1, (-1)^k/k!))); %o A343831 (PARI) a(n) = denominator(sum(k=0, n-1, binomial(n-1, k)/(k+n)!)); %Y A343831 Cf. A343830 (numerator), A343832. %K A343831 nonn,frac %O A343831 1,2 %A A343831 _Seiichi Manyama_, Apr 30 2021