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 A135750 #9 Nov 05 2016 21:05:52 %S A135750 1,1,3,17,150,1869,30937,652147,16971392,532403448,19756591654, %T A135750 854013305595,42459118750496,2401987801594055,153207626004501247, %U A135750 10930853009024058261,866325783375527683256,75806831093269510084028 %N A135750 E.g.f. A(x) satisfies: A(1 - exp(-x)) = 1 + x*A(x). %H A135750 G. C. Greubel, <a href="/A135750/b135750.txt">Table of n, a(n) for n = 0..250</a> %F A135750 E.g.f. A(x) satisfies: A(x) = 1 - log(1-x)*A(-log(1-x)). %F A135750 a(n) = Sum_{k=1..n} ( k*(-1)^(n-k)*stirling1(n,k)*a(k-1) ), n>0, a(0)=1. - _Vladimir Kruchinin_, Nov 28 2011 %t A135750 Clear[a]; a[0]:= 1; a[n_]:= a[n] = Sum[k*(-1)^(n - k)*StirlingS1[n, k]*a[k - 1], {k, 1, n}]; Table[a[n], {n, 0, 25}] (* _G. C. Greubel_, Nov 05 2016 *) %o A135750 (PARI) {a(n)=local(A=1+x);for(i=0,n,A=1-log(1-x+x*O(x^n))* (subst(A,x,-log(1-x+x*O(x^n)))));n!*polcoeff(A,n)} %o A135750 (Maxima) %o A135750 a(n):=if n=0 then 1 else sum(k*(-1)^(n-k)*stirling1(n,k)*a(k-1),k,1,n); /* _Vladimir Kruchinin_, Nov 28 2011 */ %K A135750 nonn %O A135750 0,3 %A A135750 _Paul D. Hanna_, Nov 27 2007