25480

Appears in sequences

• Number of partitions of an n-gon into (n-5) parts.at n=4A002060
• Number of tree-rooted planar maps with 3 faces and n vertices and no isthmuses.at n=12A006470
• Low temperature series for spin-1/2 Ising specific heat on 2D square lattice.at n=5A029872
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 17 ones.at n=29A031785
• Number of different words that can be formed from an n X n grid of letters, reading horizontally, vertically or diagonally.at n=19A034720
• Numbers that are divisible by 10 and are differences between two cubes in at least one way.at n=32A038854
• Variance of time for a random walk starting at 0 to reach one of the boundaries at +n or -n for the first time.at n=14A072819
• Row sums of triangle A092686, in which the convolution of each row with {1,2} produces a triangle that, when flattened, equals the flattened form of A092686.at n=8A092688
• Seventh column (m=6) of (1,4)-Pascal triangle A095666.at n=11A095669
• Triangle T(n,k) = binomial(2*n,k) *binomial(2*n-2*k,n-k), read by rows; 0<=k<=n.at n=31A142243
• Positive integers n such that n^2 = (x^4 - y^4)*(z^4 - t^4) where the pairs of integers (x,y) and (z,t) are not proportional.at n=21A147854
• Number of ways to place 2 nonattacking amazons (superqueens) on an n X n board.at n=15A172200
• Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to 10.at n=4A180290
• Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-4.at n=9A180294
• Number of 4-step self-avoiding walks on an n X n square summed over all starting positions.at n=27A188149
• Irregular triangular array read by rows T(n,k) is the number of 2-colored labeled graphs that have exactly k edges, n >= 2, 0 <= k <= A033638(n).at n=53A201143
• Numbers whose sum of triangular divisors is also a divisor and greater than 1.at n=35A209311
• Irregular triangular array read by rows. T(n,k) is the number of connected labeled bipartite graphs on n nodes with exactly k edges; n >= 1, 0 <= k <= A002620(n+1).at n=54A228861
• a(n) = Sum_{i=0..n} digsum_8(i)^3, where digsum_8(i) = A053829(i).at n=55A231682
• a(n) = Sum_{i=0..n} digsum_9(i)^3, where digsum_9(i) = A053830(i).at n=55A231686