24240

Appears in sequences

• Number of n-step polygons on hexagonal lattice.at n=10A001335
• Number of permutations of n elements with distinct cycle lengths.at n=8A007838
• Convolution of Fibonacci numbers and A014306.at n=21A023614
• Base 6 digital convolution sequence.at n=11A033643
• Expansion of g(x) - x*g(x^2), where g(x) is the g.f. of A001405.at n=17A129383
• Villegas-Zagier polynomials (listing coefficients from lowest to highest degree).at n=52A166243
• Villegas-Zagier polynomials (listing coefficients from highest to lowest degree).at n=62A166244
• Number of 3-step one or two collinear space at a time queen's tours on an n X n board summed over all starting positions.at n=11A187028
• Number of 3-step self-avoiding walks on an n X n X n cube summed over all starting positions.at n=9A187164
• Coefficient of x^n in the series 1/F(-1/2,1/2;1;16x), where F(a1,a2;b;x) is the hypergeometric series.at n=5A188266
• Numbers n such that n+(n+1), n^2+(n+1)^2, n+(n+1)^2, n^2+(n+1) are all prime.at n=30A216270
• Number of 2 X n arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..1 2 X n array.at n=11A218898
• Number of (n+2) X (4+2) 0..3 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=20A253021
• Take apart the sides of each of the integer-sided scalene triangles with perimeter n (at their vertices) and rearrange them orthogonally in 3-space so that their endpoints coincide at a single point. a(n) is the total surface area of all rectangular prisms enclosed in this way.at n=39A308235
• Practical numbers with a record gap to the next practical number.at n=11A330870
• a(n) is the least practical number A005153(k) such that A005153(k+1) - A005153(k) = 2*n, or -1 if no such number exists.at n=17A364707
• Numbers k with a prime factor other than 2 or 5 such that digsum(k) = digsum(repeating period of 1/k).at n=30A390294
• Triangle read by rows: T(n,k) is the number of nested cycle partitions of n labeled nodes into k components.at n=28A392471