146410

Appears in sequences

• Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j)*11^j.at n=19A038217
• Triangle whose (i,j)-th entry is binomial(i,j)*11^(i-j)*2^j.at n=16A038316
• First differences of 11^n (A001020).at n=5A055276
• a(n) = n^5 - n^4.at n=11A085538
• Numbers whose set of base 11 digits is {0,A}, where A base 11 = 10 base 10.at n=16A097257
• Numbers of the form (10^i)*(11^j), with i, j >= 0.at n=19A108779
• a(n) = p^4*(p-1), where p = prime(n).at n=4A138407
• a(n) = ((n-th prime)^6-(n-th prime)^4)/12.at n=4A138459
• a(n) = n^4*(n-1)*(n+1)/12.at n=10A208954
• Number of 2 X 2 matrices with all terms in {0,1,...,n} and even determinant.at n=21A210369
• Number of 2 X 2 matrices having all terms in {1,...,n} and even determinant.at n=21A211064
• Number of solutions to gcd(x^2 + y^2 + z^2 + t^2 + h^2, n) = 1 with x,y,z,t,h in [0,n-1].at n=10A238533
• Numbers n such that the n-th cyclotomic polynomial has a root mod 11.at n=19A245480
• Number of compositions of n such that the minimal distance between two identical parts equals two.at n=23A261984
• Number of (n+1) X (6+1) arrays of permutations of 0..n*7+6 with each element having index change +-(.,.) 0,0 1,2 or 2,2.at n=2A264015
• 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,2 or 2,2.at n=30A264017
• 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=31A282902
• a(n) = A276086(A276086(A276086(n))), where A276086(n) converts primorial base expansion of n into its prime product form.at n=17A328403
• List of values q^5-q^4 as q runs through A000961 (that is, 1, primes, and prime powers).at n=8A371195