cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A213869 Number of words w where each letter of the n-ary alphabet occurs 9 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.

This page as a plain text file.
%I A213869 #4 Jun 24 2012 12:58:22
%S A213869 1,1,6292,846167608,673174876488400,1785201362960729511070,
%T A213869 11481253272835564584899247346,146812609193179942830629976945746464,
%U A213869 3264601141014490309682718148875987514642243,114752550881830601773639529476205016572641397025904
%N A213869 Number of words w where each letter of the n-ary alphabet occurs 9 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 A213869 a(0) = 1: the empty word.
%e A213869 a(1) = 1: aaaaaaaaa.
%e A213869 a(2) = 6292: aaaaaaaaabbbbbbbbb, aaaaaaaababbbbbbbb, ..., baababababababaabb, baabababababababab.
%Y A213869 Row n=9 of A213275.
%K A213869 nonn
%O A213869 0,3
%A A213869 _Alois P. Heinz_, Jun 23 2012