|
%I #16 Apr 15 2016 15:19:43
%S 1,1,6,90,2520,102011,5176504,307027744,20472135280,1496594831506,
%T 117857270562568,9869468603141427,870255083860881152,
%U 80185525536941657225,7673807618627318341436,759049283017632212000140,77292554293281131959377376,8075621155990277422800518076
%N Number of words on {1,1,2,2,3,3,...,n,n} avoiding the pattern 12345.
%H 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 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 Cf. A000680, A220097, A266734.
%Y Column k=4 of A267479.
%K nonn
%O 0,3
%A _N. J. A. Sloane_, Jan 06 2016
%E More terms from _Alois P. Heinz_, Jan 14 2016
|
