|
%I #15 Sep 21 2017 11:32:22
%S 1,1,3,10,47,246,1602,11481,95503,508150,3436358,21822351,153741722,
%T 1047906107,7987668041,57017211075,456108767423,3047668772102,
%U 22857224364630,163293406206195,1236484989279502,9040845014760345,70057104400850471,517521934394653205
%N Number of n-length words w over an 8-ary alphabet {a1,a2,...,a8} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a8) >= 0, where #(w,x) counts the letters x in word w.
%H Alois P. Heinz, <a href="/A226878/b226878.txt">Table of n, a(n) for n = 0..1000</a>
%p b:= proc(n, i, t) option remember;
%p `if`(t=1, 1/n!, add(b(n-j, j, t-1)/j!, j=i..n/t))
%p end:
%p a:= n-> n!*b(n, 0, 8):
%p seq(a(n), n=0..30);
%Y Column k=8 of A226873.
%K nonn
%O 0,3
%A _Alois P. Heinz_, Jun 21 2013
|
