This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A266739 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 123. 0
 1, 1, 70, 3199, 173860, 10203181, 631326526, 40553993125, 2678871322640, 180830423671450, 12418980645870820, 864996624914197495, 60957211831578399100, 4338372535640598835279, 311386494956413595138930, 22513820432313175983170649, 1638226907374445245497453464 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Ferenc Balogh, 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, preprint arXiv:1505.01389, 2015. Shalosh B. Ekhad and Doron Zeilberger, 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, 2014 Nathaniel Shar, Experimental methods in permutation patterns and bijective proof, PhD Dissertation, Mathematics Department, Rutgers University, May 2016. CROSSREFS Cf. A220097, A266734, A266735, A266737-A266741. Sequence in context: A069296 A075923 A089274 * A227273 A298463 A275295 Adjacent sequences:  A266736 A266737 A266738 * A266740 A266741 A266742 KEYWORD nonn AUTHOR N. J. A. Sloane, Jan 06 2016 EXTENSIONS More terms from Alois P. Heinz, Jan 14 2016 STATUS approved

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 22 14:18 EDT 2019. Contains 322349 sequences. (Running on oeis4.)