121000
domain: N
Appears in sequences
- Cubes written in base 7.at n=27A004637
- Triangle T(n,k) of number of minimal 3-covers of a labeled n-set that cover k points of that set uniquely (k=3,..,n).at n=34A057964
- Numbers of the form (10^i)*(11^j), with i, j >= 0.at n=17A108779
- Powerful(1) numbers (A001694) whose digit reversal is a brilliant number (A078972).at n=29A115676
- 3-smooth numbers in ternary representation.at n=31A131096
- Binomial matrix (1,10^n) read by antidiagonals.at n=33A164899
- a(n) = n^3*(n+1)^2*(n+2)/12.at n=9A165187
- Triangle a(n,k) = binomial(n,k)*binomial(n+1,k+1)*binomial(n+2,k+2) read by rows.at n=56A187552
- Numbers with prime factorization p^2*q^3*r^3 where p, q, and r are distinct primes.at n=14A190106
- Numbers k such that sum of 4th power of digits of k equals the sum of prime divisors of k.at n=13A217532
- T(n,k) = number of (n+1) X (k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 1,1 or 1,2.at n=25A264071
- Number of (5+1) X (n+1) arrays of permutations of 0..n*6+5 with each element having index change +-(.,.) 0,0 1,1 or 1,2.at n=2A264074
- Least numbers k that can be expressed as k = a' + b', with k = a + b, in exactly n ways, where a' and b' are the arithmetic derivatives of a and b.at n=10A292362
- Primitive coreful-infinitary abundant numbers: powerful numbers k for which A363331(k) > 2*k.at n=37A391505