28333
domain: N
Appears in sequences
- a(n) = ceiling(10000*log(n)).at n=16A004245
- Number of different configurations of an n-block of a shift space with k symbols where each symbol but the first must appear isolated and separated from others by a block of length at least m made of first symbols. Here k=19 and m=2.at n=7A131600
- Number of ways to split an integer partition of n into consecutive subsequences of equal length.at n=32A323433
- Array read by downward antidiagonals: A(n,k) = A(n-1,k+1) + (k+1)*Sum_{j=0..k} A(n-1,j) with A(0,k) = k+1, n >= 0, k >= 0.at n=32A371567