37140
domain: N
Appears in sequences
- Number of partitions of n^2 into exactly n nonzero parts, such that there are at most one 1's, two 2's, ... n-1 n-1's, n n's, n-1 n+1's, ... two 2n-2's and one 2n-1.at n=8A062881
- Convolution of Fibonacci F(n+1), n>=0, with F(n+8), n>=0.at n=11A067431
- Number of binary strings of length n with equal numbers of 00101 and 10110 substrings.at n=16A164250
- Triangle read by rows, T(n, k) = [x^k](Sum_{k=0..n}(-1)^(n-k)*Stirling2(n, k)*k!* x^k)^2, for 0 <= k <= 2n.at n=31A290696
- Triangle read by rows, numerators of coefficients (in rising powers) of rational polynomials P(n, x) such that Integral_{x=0..1} P'(n, x) = BernoulliMedian(n).at n=37A291447
- Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with k strongly connected components and without isolated nodes.at n=25A361588
- Irregular triangle read by rows: T(n,k) is the number of flattened Catalan words of length n with exactly k short peak, with k >= 0.at n=37A372879
- a(n) = Sum_{k=0..floor(n/3)} binomial(3*n-8*k-1,k).at n=20A373655
- Numbers x such that there exist three integers 0<x<=y, z>0 and w>0 such that sigma(x)^3 = sigma(y)^3 = x^3 + y^3 + z^3 + w^3.at n=47A385397
- E.g.f. A(x) satisfies A(x) = 1 + x*exp(x^2)*A(x)^3.at n=5A389696