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 A266741 #14 Apr 15 2016 15:21:46
%S A266741 1,1,70,34650,63063000,142951955371,389426248416626,
%T A266741 1238402046254860022,4454056622413300252928,
%U A266741 17668055644599543583018570,75867559322054514745288107364,347785237467609520037269752908904,1684035818793607129226446293560872032
%N A266741 Number of words on {1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,...,n,n,n,n} avoiding the pattern 12345.
%H A266741 Ferenc Balogh, <a href="http://arxiv.org/abs/1505.01389">A generalization of Gessel's generating function to enumerate words with double or triple occurrences in each letter and without increasing subsequences of a given length</a>, preprint arXiv:1505.01389, 2015.
%H A266741 Shalosh B. Ekhad and Doron Zeilberger, <a href="http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/sloane75.html">The Generating Functions Enumerating 12..d-Avoiding Words with r occurrences of each of 1,2, ..., n are D-finite for all d and all r</a>, 2014
%Y A266741 Cf. A014608, A220097, A266734, A266735, A266737-A266740.
%K A266741 nonn
%O A266741 0,3
%A A266741 _N. J. A. Sloane_, Jan 06 2016
%E A266741 More terms from _Alois P. Heinz_, Jan 14 2016