Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #5 Mar 30 2012 17:37:37
%S 1,2,202,53768,19341130,8151741752,3795394507240,1892725627422240,
%T 992594962274742090,540969426319412656280,303934170379321788972952,
%U 175019302819674622982714912,102858166922334018149414066152,61493440878115135100772134725088
%N Number of words, either empty or beginning with the first letter of the cyclic 6-ary alphabet, where each letter of the alphabet occurs n times and letters of neighboring word positions are equal or neighbors in the alphabet.
%C The first and the last letters are considered neighbors in a cyclic alphabet. The words are not considered cyclic here.
%C a(n) is also the number of (6*n-1)-step walks on 6-dimensional cubic lattice from (1,0,...,0) to (n,n,...,n) with positive unit steps in all dimensions such that the indices of dimensions used in consecutive steps differ by less than 2 or are in the set {1,6}.
%Y Column k=6 of A208879.
%K nonn,walk
%O 0,2
%A _Alois P. Heinz_, Mar 05 2012