153254

Appears in sequences

• a(n) = (n/2)*binomial(n-1, floor((n-1)/2)) - 2^(n-2).at n=17A107373
• The number of returns to the origin in all possible one-dimensional walks of length 2n.at n=8A172060
• Squarefree integers m > 1 such that if prime p divides m, then s_p(m) >= p and s_p(m) == 2 (mod p-1), where s_p(m) is the sum of the base p digits of m.at n=24A324404
• T(n,m) is the denominator of the resistance between two diametrically opposite nodes of a rectangular electric network of n*m quadratic meshes in which all edges are replaced by one-ohm resistors, where T(n,m) is a triangle read by rows.at n=35A357114