This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A266740 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 1234. 1

%I

%S 1,1,70,34650,16140983,8854463421,5532980565456,3798011394008444,

%T 2798461806432513085,2179251644112128926809,1774029308605731224234922,

%U 1497612094060753803137726582,1303178757814574200714348639251,1163471249071555286949793002571005

%N 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 1234.

%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. A220097, A266734, A266735, A266737-A266741.

%K nonn

%O 0,3

%A _N. J. A. Sloane_, Jan 06 2016

%E More terms from _Alois P. Heinz_, Jan 14 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 21 11:03 EDT 2019. Contains 322328 sequences. (Running on oeis4.)