29358
domain: N
Appears in sequences
- Numbers k for which there exists some m such that k = Sum_{i=1..1+floor(log_10(k))} binomial(m, d_i), where d_i is the i-th digit of k.at n=27A055481
- Pseudo-random numbers: MS C 6.0 version.at n=7A084275
- Numbers k such that k and 5*k, taken together, are pandigital.at n=26A115925
- Expansion of Product_{k>=1} 1/(1 - x^k)^(k*(3*k-2)).at n=9A274998
- Numbers that can be written as (k + sum of digits of k) for some k, then as (m + product of digits of m) for some m, also as (q * product of digits of q) for some q, and finally as (t * sum of digits of t) for some t.at n=36A337839
- Triangle read by rows: T(n,k) is the number of symmetries of the n-dimensional hypercube that fix exactly 2*k facets; n,k >= 0.at n=50A342381