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 A092685 #7 Jun 13 2017 21:55:59 %S A092685 1,2,5,11,25,55,120,258,551,1169,2469,5193,10885,22746,47404,98553, %T A092685 204443,423259,874680,1804556,3717348,7647075,15711194,32242013, %U A092685 66096274,135366764,276988466,566312984,1156974619,2362043602 %N A092685 Row sums of triangle A092683, in which the convolution of each row with {1,1} produces a triangle that, when flattened, equals the flattened form of A092683. %F A092685 G.f.: A(x,y) = H(x)*(1-x)/(1-2*x), where H(x) satisfies: H(x) = H(x^2/(1-x))/(1-x) and H(x) is the g.f. of A092684. - _Paul D. Hanna_, Jul 17 2006 %o A092685 (PARI) {T(n,k)=if(n<0 || k>n,0, if(n==0 && k==0,1, if(n==1 && k<=1,1, if(k==n,T(n,0), T(n-1,k)+T(n-1,k+1)))))} %o A092685 a(n)=sum(k=0,n,T(n,k)) %o A092685 (PARI) {a(n)=local(A,F=1+x,d=1,G=x,H=1+x,S=ceil(log(n+1)/log(d+1))); for(i=0,n,G=x*subst(F,x,G+x*O(x^n)));for(i=0,S,H=subst(H,x,x*G^d+x*O(x^n))*G/x); A=(x*H-y*subst(H,x,x*y^d +x*O(x^n)))/(x*subst(F,x,y)-y); sum(k=0,2*n,polcoeff(polcoeff(A,n,x),k,y))} \\ _Paul D. Hanna_, Jul 17 2006 %Y A092685 Cf. A092683, A092684, A092686, A092689, A120897, A120902. %K A092685 nonn %O A092685 0,2 %A A092685 _Paul D. Hanna_, Mar 04 2004