login
This site is supported by donations to The OEIS Foundation.

 

Logo


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
1, 1, 70, 34650, 16140983, 8854463421, 5532980565456, 3798011394008444, 2798461806432513085, 2179251644112128926809, 1774029308605731224234922, 1497612094060753803137726582, 1303178757814574200714348639251, 1163471249071555286949793002571005 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..13.

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

CROSSREFS

Cf. A220097, A266734, A266735, A266737-A266741.

Sequence in context: A177661 A177672 A177299 * A177640 A177641 A177648

Adjacent sequences:  A266737 A266738 A266739 * A266741 A266742 A266743

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 25 15:02 EDT 2019. Contains 321470 sequences. (Running on oeis4.)