23580

Appears in sequences

• Triangle T(n,k) = binomial(n, k)*(3*binomial(n, k)^2 - binomial(n, k) - 1), read by rows.at n=24A144405
• Number of permutations of 5 indistinguishable copies of 1..n arranged in a circle with exactly 3 adjacent element pairs in decreasing order.at n=2A151604
• Values x for records of the minima of the positive distance d between the ninth power of a positive integer x and the square of an integer y such that d = x^9 - y^2 (x <> k^2 and y <> k^9).at n=28A179791
• Rectangular array, read by upward diagonals: T(n,m) is the number of Young tableaux that can be realized as the ranks of the outer sums a_i + b_j where a = (a_1, ... a_n) and b = (b_1, ... b_m) are real monotone vectors in general position (all sums different).at n=30A211400
• Number of Hamiltonian cycles in the graph C_n X C_n.at n=2A222199
• Row 3 of array in A211400.at n=5A255489
• Array read by antidiagonals: T(n,m) = number of Hamiltonian cycles in C_n X C_m.at n=40A270273
• Positive numbers m such that m^2 - 1 divides 4^m - 1.at n=20A271842
• Expansion of x * (d/dx) Product_{k>=0} 1/(1 - x^(2^k)).at n=45A304909
• Positive integers that have exactly ten representations of the form 1 + p1 * (1 + p2* ... * (1 + p_j)...), where [p1, ..., p_j] is a (possibly empty) list of distinct primes.at n=29A317400
• T(n, k) = [x^k] n! [t^n] 1/(exp((V*(2 + 2*t + V))/(4*t))*sqrt(1 + V)) where V = W(-2*t*x) and W denotes the Lambert function. Table read by rows, T(n, k) for 0 <= k <= n.at n=19A343806
• Number of Hamiltonian cycles in C_5 X C_n.at n=3A358853
• a(n) = Sum_{k=0..n} floor(sqrt(k))^5.at n=28A363499
• Number of integer partitions of n whose minima of maximal anti-runs are not all different.at n=38A375404