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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A213868 Number of words w where each letter of the n-ary alphabet occurs 8 times and 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. 1

%I #4 Jun 24 2012 12:58:19

%S 1,1,1859,48349015,5795673908453,1953740543358042205,

%T 1409438188685787895321841,1835364055105945091130559202709,

%U 3847028733161627562733350467148495403,11963401430840044468894095677711389363239184,51960277212541922189750307005207837858451630919380

%N Number of words w where each letter of the n-ary alphabet occurs 8 times and 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.

%e a(0) = 1: the empty word.

%e a(1) = 1: aaaaaaaa.

%e a(2) = 1859: aaaaaaaabbbbbbbb, aaaaaaababbbbbbb, ..., baabababababaabb, baababababababab.

%Y Row n=8 of A213275.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Jun 23 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 August 3 21:27 EDT 2024. Contains 374905 sequences. (Running on oeis4.)