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 A268844 #7 Mar 03 2016 03:02:07 %S A268844 1,192621953,8445885515991841,211301962987912098409729, %T A268844 3969183064899133655031651559801, %U A268844 63178476289432401423971737795658030945,909546798992441266072332791609067485208949369,12324197596430667064913735085330208112438377122058241 %N A268844 Number of sequences with n copies each of 1,2,...,8 and longest increasing subsequence of length 8. %H A268844 Alois P. Heinz, <a href="/A268844/b268844.txt">Table of n, a(n) for n = 1..60</a> %H A268844 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 A268844 a(n) ~ 8^(8*n + 1/2) / (2*Pi*n)^(7/2). - _Vaclav Kotesovec_, Mar 03 2016 %Y A268844 Column k=8 of A047909. %K A268844 nonn %O A268844 1,2 %A A268844 _Alois P. Heinz_, Feb 14 2016