71000

Appears in sequences

• Cubes written in base 9.at n=35A004639
• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 3.at n=18A049892
• Numbers k such that k and k^2 use only the digits 0, 1, 4, 5 and 7.at n=14A136856
• Number of right triangles on a (n+1)X9 grid.at n=22A189813
• Number of (n+1) X 3 0..1 arrays with the number of clockwise edge increases in every 2 X 2 subblock the same.at n=5A205249
• Number of (n+1)X7 0..1 arrays with the number of clockwise edge increases in every 2X2 subblock the same.at n=1A205253
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the number of clockwise edge increases in every 2X2 subblock the same.at n=22A205255
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the number of clockwise edge increases in every 2X2 subblock the same.at n=26A205255
• a(n)=least k such that A284821(n) = A284761(k).at n=19A284822
• Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1<=k<=m positions can be picked in an m X m square grid such that the picked positions have a point symmetry but no line symmetry.at n=33A292155
• a(n) = 5*(n+1)*(9*n+4).at n=39A304507
• a(0) = 1, a(n) = (2*n^5 + 20*n^3 + 23*n) * 2/15 for n>=1.at n=12A364429