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 A224298 #7 Apr 03 2013 12:00:09 %S A224298 0,0,0,0,0,10,196,2477,25886,244233,2167834,18510734,154082218, %T A224298 1260811144,10198142484,81848366557,653537296202,5201485318177, %U A224298 41321901094750,327996498249202 %N A224298 Number of permutations in S_n containing exactly 3 increasing subsequences of length 4. %D A224298 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 A224298 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 A224298 # programs can be obtained from the Nakamura and Zeilberger link. %Y A224298 Cf. A005802, A217057, A224249. %K A224298 nonn %O A224298 1,6 %A A224298 _Brian Nakamura_, Apr 03 2013