1210000

Appears in sequences

• Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*11^j.at n=17A038313
• Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)*10^j.at n=18A038324
• Squares whose consecutive digits vary by at most 1.at n=11A061850
• Write n in binary then square as if written in base 10.at n=12A063009
• Squares in every base >=3 (involving no carries and no digit apart from 0, 1 and 2).at n=11A066139
• Square such that the next three squares also having a square digit sum.at n=15A068834
• k^2 is a term if k^2 + (k-1)^2 and k^2 + (k+1)^2 are primes.at n=30A075577
• Squares in which the neighboring digits differ at most by 1. Neighbors of 1 are 0 and 2, neighbors of 0 are 1 and 9.at n=13A087553
• Numbers of the form (10^i)*(11^j), with i, j >= 0.at n=23A108779
• Numbers n such that n multiplied by its reverse yields a fourth power.at n=20A131760
• Binomial matrix (1,10^n) read by antidiagonals.at n=42A164899
• Numbers with prime factorization p^2*q^4*r^4 where p, q, and r are distinct primes.at n=14A190471
• 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=33A264071
• Number of (6+1) X (n+1) arrays of permutations of 0..n*7+6 with each element having index change +-(.,.) 0,0 1,1 or 1,2.at n=2A264075
• Squares whose largest decimal digit is 2.at n=7A277946
• Squares using only decimal digits 0,1,2,3.at n=15A331543
• a(n) is the least number with exactly n divisors of the form 3*k+1.at n=37A364582
• a(n) is the least number with exactly n divisors of the form 3*k+2.at n=37A364583
• Squares where larger digits have smaller multiplicity.at n=30A378498
• Squares in A378769.at n=25A378984