49536

Appears in sequences

• Number of one-sided triangulations of the disk; or flexagons of order n; or unlabeled plane trivalent trees (n-2 internal vertices, all of degree 3 and hence n leaves).at n=13A001683
• arcsinh(arcsin(tanh(x)))=x-2/3!*x^3+24/5!*x^5-776/7!*x^7+49536/9!*x^9...at n=4A012128
• Numbers occurring twice in A068627.at n=32A068628
• a(0) = 1; for n>0, a(n) = 16 times sum of cubes of divisors of n.at n=14A092820
• Number of dual Hamiltonian cubic polyhedra or planar 3-connected Yutsis graphs on 2n nodes.at n=9A115340
• T(n,k) is the number of n-step king-knight's tours (piece capable of both kinds of moves) on a k X k board summed over all starting positions.at n=52A187850
• Number of 8-step king-knight's tours (piece capable of both kinds of moves) on an n X n board summed over all starting positions.at n=2A187856
• Numbers with prime factorization pq^2r^7.at n=19A190466
• 2-dimensional array T(n, k) listed by antidiagonals for n >= 2, k >= 1 giving the number of acyclic paths of length k in the graph G(n) whose vertices are the integer lattice points (p, q) with 0 <= p, q < n and with an edge between v and w iff the line segment [v, w] contains no other integer lattice points.at n=29A247944
• Number of triangular number parts in all partitions of n.at n=32A263235
• Number of nX5 0..3 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling three exactly once.at n=1A269211
• T(n,k)=Number of nXk 0..3 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling three exactly once.at n=16A269214
• Number of 2 X n 0..3 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling three exactly once.at n=4A269215
• a(n) = n! * Sum_{k=0..n-1} (-2)^k / k!.at n=9A335111