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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A266738 Number of words on {1,1,1,2,2,2,3,3,3,4,4,4,...,n,n,n} avoiding the pattern 12345. 0
1, 1, 20, 1680, 369600, 117392909, 46121962742, 21198300356500, 11003612776114008, 6290031043253973544, 3887357166155963541538, 2562077915376091538040250, 1782153151031487742187453640, 1297781266782084301101836538690, 983066960483171632842827775906144 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

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

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. A014606, A220097, A266734, A266735, A266736-A266741.

Sequence in context: A177633 A177634 A177293 * A177605 A177606 A177617

Adjacent sequences:  A266735 A266736 A266737 * A266739 A266740 A266741

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