377904

Appears in sequences

• Number of arrangements of 5 nonzero numbers x(i) in -n..n with the sum of x(i)*x(i+1) equal to zero.at n=19A188251
• Sum_{n>=0} a(n) * x^n / (n!)^2 = 1 / BesselJ(0,2*sqrt(x))^4.at n=5A336639
• Square array read by descending antidiagonals. T(n,k) is the number of ways to separate the columns of an ordered pair of n-permutations (that have been written as a 2 X n array, one atop the other) into k cells so that no cell has a column rise. For n >= 0, k >= 0.at n=50A340986