73654

Appears in sequences

• Numbers n > 9 such that x^n + x^9 + x^8 + x^7 + x^6 + x^5 + x^4 + x^3 + x^2 + x +1 is irreducible over GF(2).at n=27A057487
• A new general triangle sequence based on the Eulerian form in three parts ( subtraction):m=2; t0(n,k)=If[n*k == 0, 1, Sum[(-1)^j Binomial[n + 1, j](k + 1 - j)^n, {j, 0, k + 1}]] t(n,k,m)=If[n == 0, 1, ( m*(n - k) + 1)*t0(n - 1 + 1, k - 1) + (m*k + 1)*t0(n - 1 + 1, k) - m*k*(n - k)*t0(n - 2 + 1, k - 1)].at n=47A157180
• A new general triangle sequence based on the Eulerian form in three parts ( subtraction):m=2; t0(n,k)=If[n*k == 0, 1, Sum[(-1)^j Binomial[n + 1, j](k + 1 - j)^n, {j, 0, k + 1}]] t(n,k,m)=If[n == 0, 1, ( m*(n - k) + 1)*t0(n - 1 + 1, k - 1) + (m*k + 1)*t0(n - 1 + 1, k) - m*k*(n - k)*t0(n - 2 + 1, k - 1)].at n=52A157180
• Number of n X 3 arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 n X 3 array.at n=9A220148
• a(n) is the number of prime powers k such that ceiling(log_2(k)) = n.at n=20A304521