login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A266741 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 12345. 5

%I #14 Apr 15 2016 15:21:46

%S 1,1,70,34650,63063000,142951955371,389426248416626,

%T 1238402046254860022,4454056622413300252928,

%U 17668055644599543583018570,75867559322054514745288107364,347785237467609520037269752908904,1684035818793607129226446293560872032

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

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)