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 A224248 #10 Apr 03 2013 17:35:05 %S A224248 0,0,0,0,0,1,20,270,3142,34291,364462,3844051,40632886,432715409, %T A224248 4655417038,50667480496,558143676522,6223527776874,70228214538096, %U A224248 801705888742781,9254554670121572,107975393459449243,1272651313142352772,15145990284267530992 %N A224248 Number of permutations in S_n containing exactly one increasing subsequence of length 5. %D A224248 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 A224248 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 A224248 # programs can be obtained from the Nakamura and Zeilberger link. %Y A224248 Cf. A047889, A217057. %K A224248 nonn %O A224248 0,7 %A A224248 _Brian Nakamura_, Apr 02 2013