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 A268841 #9 Mar 02 2016 19:43:44 %S A268841 1,11389,50775091,162588279629,449363984934526,1162145520205261219, %T A268841 2931247600219365331976,7370846583668954571029069, %U A268841 18683332440278067962764855531,47964531978782851644184417448714,124871404619023570844557764310152386 %N A268841 Number of sequences with n copies each of 1,2,...,5 and longest increasing subsequence of length 5. %H A268841 Vaclav Kotesovec and Alois P. Heinz, <a href="/A268841/b268841.txt">Table of n, a(n) for n = 1..150</a> (terms n=1..80 from Vaclav Kotesovec) %H A268841 J. D. Horton and A. Kurn, Counting sequences with complete increasing subsequences, Congressus Numerantium, 33 (1981), 75-80. <a href="http://www.ams.org/mathscinet-getitem?mr=681905">MR 681905</a> %F A268841 a(n) ~ 5^(5*n+1/2) / (2*Pi*n)^2. - _Vaclav Kotesovec_, Feb 21 2016 %Y A268841 Column k=5 of A047909. %K A268841 nonn %O A268841 1,2 %A A268841 _Alois P. Heinz_, Feb 14 2016