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 A268846 #7 Mar 03 2016 03:03:54 %S A268846 1,248040482741,9891092676022013399311, %T A268846 195676681342450229063393365876181, %U A268846 2683885055441747960475755652405552969614101,29539005031390270063835072245497576346701114916209911,282011782951614089942684801199121868144180995938610087493133121 %N A268846 Number of sequences with n copies each of 1,2,...,10 and longest increasing subsequence of length 10. %H A268846 Alois P. Heinz, <a href="/A268846/b268846.txt">Table of n, a(n) for n = 1..50</a> %H A268846 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 A268846 a(n) ~ 10^(10*n + 1/2) / (2*Pi*n)^(9/2). - _Vaclav Kotesovec_, Mar 03 2016 %Y A268846 Column k=10 of A047909. %K A268846 nonn %O A268846 1,2 %A A268846 _Alois P. Heinz_, Feb 14 2016