27120

Appears in sequences

• Number of points on surface of 4-dimensional cube.at n=15A008511
• Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 13 (most significant digit on right).at n=11A061966
• a(0) = 1, a(1) = 5; for n > 1, a(n) = 6*n*a(n-1) + Sum_{k=1..n-2} a(k)*a(n-k-1).at n=4A062980
• a(n) = n*(n+1)*(n^2+1)/2.at n=15A071237
• Least number beginning with n such that every partial sum is a square.at n=26A095158
• a(n) = n*(n^2+4).at n=30A155965
• Least positive integer x such that x and n*x are both differences of fourth powers.at n=22A228760
• T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=48A240394
• Number of 4Xn 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=6A240396
• Number of finite, negative, totally ordered monoids of size n (semigroups with a neutral element that is also the top element).at n=7A253950
• Coefficients of polynomials g_b(x) that arise in the generating function for rooted maps (A053979).at n=14A305873
• Number of quadrilaterals in the graph formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares).at n=21A332607
• E.g.f. satisfies: A(x)^(A(x)^3) = 1/(1 - x).at n=5A349653
• a(n)/binomial(n,2)! is the probability that the minimum spanning tree of the complete graph of n vertices with i.i.d. random edge weights is a specific path.at n=4A374293
• Array read by antidiagonals: T(n,k) is the number of rooted k-regular combinatorial maps with n vertices, n >= 0, k >= 1.at n=63A380622