76000

Appears in sequences

• Number of 3-voter voting schemes with n linearly ranked choices.at n=37A007009
• Numbers k such that the decimal expansion of k^2 contains k as a substring.at n=32A018834
• Substring of both its square and its cube.at n=30A029943
• Internal digits of n^2 include digits of n as substring.at n=19A046836
• a(n) = n^2*binomial(n,2).at n=19A092364
• Triangle of coefficients p(k, x), where p(k, x) = 2*(k-1)*p(k-1, x) -x*p(k-2, x), read by rows.at n=32A123235
• Numbers k such that k and k^2 use only the digits 0, 1, 5, 6 and 7.at n=13A136869
• Numbers k such that k and k^2 use only the digits 0, 3, 5, 6 and 7.at n=13A136937
• Numbers k such that k and k^2 use only the digits 0, 4, 5, 6 and 7.at n=9A136948
• Numbers k such that k and k^2 use only the digits 0, 5, 6 and 7.at n=4A136962
• Numbers k such that k and k^2 use only the digits 0, 5, 6, 7 and 8.at n=7A136963
• Numbers k such that k and k^2 use only the digits 0, 5, 6, 7 and 9.at n=6A136964
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 11 (11 maximizes T(1,1)).at n=28A233883
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 11 (11 maximizes T(1,1)).at n=35A233883
• Number of (7+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=31A250661
• a(n) = 4*(n + 1)*(n + 2)*(4*n + 3)/3.at n=23A267522
• Consider primitive pairs of integers (b, c) with b < 0 such that x^5 + b*x + c = 0 is irreducible and solvable by radicals: sequence gives values of c.at n=7A371558
• a(n) is the least number k such that the equation phi(x) = k has exactly n solutions and the arithmetic mean of these solutions is an integer, or -1 if no such number exists.at n=34A389860