cp's OEIS Frontend

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.

A112501 Row sums of triangle A112500.

This page as a plain text file.
%I A112501 #8 Mar 04 2018 03:16:01
%S A112501 1,2,6,23,108,601,3874,28448,234903,2158498,21883451,243025718,
%T A112501 2938265815,38469994687,542905969228,8224586470983,133260591917731,
%U A112501 2301776455966976,42258406133001866,822404997883448574
%N A112501 Row sums of triangle A112500.
%F A112501 a(n) = Sum_{k=1..n+1} A112500(n, k), n >= 0.
%F A112501 G.f: Sum_{n>=1} x^(n-1)/(Product_{k=1..n} (1 - k*x)^(n-k+1)). - _Paul D. Hanna_, Feb 16 2010
%e A112501 Contribution from _Paul D. Hanna_, Feb 16 2010: (Start)
%e A112501 G.f. A(x) = 1 + 2*x + 6*x^2 + 23*x^3 + 108*x^4 + 601*x^5 + ...
%e A112501 A(x) = 1/(1-x) + x/[(1-x)^2*(1-2x)] + x^2/[(1-x)^3*(1-2x)^2*(1-3x)] + ... (End)
%o A112501 (PARI) {a(n)=polcoeff(sum(m=1,16,x^(m-1)/prod(k=1,m,(1-k*x +x*O(x^n))^(m-k+1))),n)} \\ _Paul D. Hanna_, Feb 16 2010
%K A112501 nonn,easy
%O A112501 0,2
%A A112501 _Wolfdieter Lang_, Oct 14 2005