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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A213292 Number of n-length words w over 4-ary alphabet such that for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z. 2

%I

%S 1,4,16,46,118,276,712,1805,4895,13280,37993,109386,328219,992413,

%T 3101399,9764376,31580645,102797899,342075208,1144125506,3896297053,

%U 13319243655,46206520968,160729837020,565901313043,1996113320841,7111795754941,25369213794266

%N Number of n-length words w over 4-ary alphabet such that for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z.

%H Alois P. Heinz, <a href="/A213292/b213292.txt">Table of n, a(n) for n = 0..130</a>

%Y Column k=4 of A213276.

%K nonn

%O 0,2

%A _Alois P. Heinz_, Jun 08 2012

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.

Last modified July 1 10:21 EDT 2022. Contains 354959 sequences. (Running on oeis4.)