51592

Appears in sequences

• Number of fullerenes with 2n vertices (or carbon atoms).at n=32A007894
• arctan(arctan(x)*exp(x)) = x + 2/2!*x^2 - 1/3!*x^3 - 28/4!*x^4 - 107/5!*x^5 + ...at n=8A012411
• Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and having sum of the heights of its pyramids equal to k (a pyramid is a sequence u^pd^p or U^pd^(2p) for some positive integer p, starting at the x-axis; p is the height of the pyramid).at n=51A109157
• Number of ways to arrange 2 nonattacking knights on the lower triangle of an n X n board.at n=24A194486
• Number of partitions of (4, n) into a sum of distinct pairs.at n=29A268347
• a(n) is the number of asymmetrical polyiamonds of n cells.at n=13A359688