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 A224292 #5 Apr 03 2013 11:56:24 %S A224292 0,0,0,1,10,71,444,2617,14958,84063,467960,2591265,14308722,78911943, %T A224292 435066228,2399404345,13242035030,73150006271,404525810928, %U A224292 2239684086529,12415205896794,68905402034311,382897019146540,2130255439081721,11865617032955070 %N A224292 Number of permutations of length n avoiding 1234 and containing exactly 1 occurrence of 1243. %C A224292 a(n) is also the number of permutations of length n avoiding 1243 and containing exactly 1 occurrence of 1234. %H A224292 B. Nakamura, <a href="http://arxiv.org/abs/1301.5080">Approaches for enumerating permutations with a prescribed number of occurrences of patterns</a>, arXiv 1301.5080, 2013. %p A224292 # Programs can be obtained from author's personal website. %Y A224292 Cf. A006318. %K A224292 nonn %O A224292 1,5 %A A224292 _Brian Nakamura_, Apr 03 2013