464640
domain: N
Appears in sequences
- Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j)*11^j.at n=23A038241
- Triangle whose (i,j)-th entry is binomial(i,j)*11^(i-j)*4^j.at n=25A038318
- Number of partitions of n-set with 3 block sizes.at n=5A133118
- Triangular array read by rows: T(n,k) is the number of set partitions of {1,2,...,n} that have exactly k distinct block sizes.at n=26A208437
- Subsets of {1,2,...,n-6} without differences equal to 3 or 6.at n=38A224810
- Consider a decimal number of k>=2 digits x = d_(k)*10^(k-1) + d_(k-1)*10^(k-2) + ... + d_(2)*10 + d_(1) and the transform T(x)-> (d_(k)+d_(k-1) mod 10)*10^(k-1) + (d_(k-1)+d_(k-2) mod 10)*10^(k-2) + ... + (d_(2)+d_(1) mod 10)*10 + (d_(1)+d(k) mod 10). Sequence lists the numbers x such that T(x) divides x.at n=26A244286