Triangle, read by rows, where row n lists coefficients of q in B(n,q) that satisfies: B(n,q) = Sum_{k=0..n-1} C(n-1,k)*B(k,q)*q^k for n>0, with B(0,q) = 1; row sums equal the Bell numbers: B(n,1) = A000110(n).
1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 3, 4, 2, 1, 1, 1, 4, 6, 10, 9, 7, 7, 4, 2, 1, 1, 1, 5, 10, 20, 25, 26
2 seqfan posts
Fri Oct 22 08:51:50 CEST 2010 [seqfan] Binary counter with random bits