1610510
domain: N
Appears in sequences
- Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)*11^j.at n=17A038325
- Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)*11^j.at n=18A038325
- First differences of 11^n (A001020).at n=6A055276
- Let u(1)=u(2)=u(3)=1, u(n+3)=(n*u(n)+(n+1)*u(n+1)+(n+2)*u(n+2))/(n+3); sequence gives values of n such that u(n) is an integer.at n=24A075770
- a(n) = n^6 - n^5.at n=11A085539
- Numbers whose set of base 11 digits is {0,A}, where A base 11 = 10 base 10.at n=32A097257
- Number of n-digit palindromes in base n.at n=9A099767
- Numbers of the form (10^i)*(11^j), with i, j >= 0.at n=26A108779
- a(n) = p^5*(p-1) where p = prime(n).at n=4A138412
- Numbers n such that the n-th cyclotomic polynomial has a root mod 11.at n=23A245480
- Square array A(n, k) read by antidiagonals downwards: multiplicative order of 2 modulo prime(n)^k, where k runs over the positive integers.at n=39A282902
- a(n) = phi(n^6) = n^5*phi(n).at n=10A306411
- Sequence related to chains in type D noncrossing partitions.at n=9A363861