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 A224250 #8 Apr 02 2013 12:39:54 %S A224250 0,0,0,0,0,5,128,2124,29445,373379,4517921,53342405,622358262, %T A224250 7229196009,83984283157,978558652802,11455522117193,134879815196252, %U A224250 1598299236441571,19067702481168369 %N A224250 Number of permutations in S_n containing exactly 2 increasing subsequences of length 5. %D A224250 B. Nakamura and D. Zeilberger, Using Noonan-Zeilberger Functional Equations to enumerate (in Polynomial Time!) Generalized Wilf classes, Adv. in Appl. Math. 50 (2013), 356-366. %H A224250 B. Nakamura and D. Zeilberger, <a href="http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/Gwilf.html">Using Noonan-Zeilberger Functional Equations to enumerate (in Polynomial Time!) Generalized Wilf classes</a> %p A224250 # programs can be obtained from the Nakamura and Zeilberger link. %Y A224250 Cf. A047889, A224248. %K A224250 nonn %O A224250 1,6 %A A224250 _Brian Nakamura_, Apr 02 2013