41100

Appears in sequences

• Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n containing k subwords of the type uh^ju, dH^jd, or dh^ju for some j>0, where u=(1,1), d=(1,-1) and h=(1,0) (can be easily expressed using RNA secondary structure terminology).at n=57A098056
• Integer part of 5th root of product of first n primes.at n=17A127602
• Lower triangular array, called S1hat(-5), related to partition number array A145372.at n=48A145373
• The number of 5 x 5 matrices of nonnegative integers such that the sum of the entries in the i-th row equals the sum of the i-th column for each i and the total sum equals n.at n=8A209836
• Smallest integer m such that gcd{x | sum of proper divisors of x is m} is equal to 2*n, when there are at least two such x's.at n=29A253303
• Expansion of r(q^5) / r(q)^5 in powers of q where r() is the Rogers-Ramanujan continued fraction.at n=38A285585
• Exponential (2,3)-perfect numbers: numbers m such that esigma(esigma(m)) = 3m, where esigma(m) is the sum of exponential divisors of m (A051377).at n=36A328132
• a(n) is the permanent of the n X n matrix A(n) that is defined as A[i,j,n] = (n mod 2) + abs((n + 1)/2 - i) + abs((n + 1)/2 - j).at n=5A349108