26785

Appears in sequences

• Convolution of odd numbers and A001950.at n=30A023659
• Decimal part of a(n)^(1/3) starts with reversal of its integer part: first term of runs.at n=27A034309
• a(n) = a(n-1) + 2*(n-1)*a(n-2).at n=9A047974
• a(n) = sum of terms in n-th row of A078448.at n=23A078449
• Exponential Riordan array (e^(x(1+x)),x).at n=45A122832
• a(n) = n*(n+1)*(5*n^2 - n - 3)/2.at n=10A172118
• Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having one, two, three, four, five or six distinct values for every i,j,k<=n.at n=6A211581
• Number of nondecreasing -n..n vectors of length 4 whose dot product with some other -n..n vector equals 4.at n=12A226343
• Triangle read by rows: T(n,k) is the number of nilpotent subpermutations on an n-set, each of nilpotency index less than or equal to k.at n=47A261764
• Number T(n,k) of set partitions of [n] with minimal block length multiplicity equal to k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=68A271424
• Number of set partitions of [n] with minimal block length multiplicity equal to two.at n=9A271762
• Square array A(n,k), n >= 0, k >= 1, read by antidiagonals downwards, where column k is the expansion of e.g.f. exp(Sum_{j=1..k} x^j).at n=64A293669
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * Sum_{j=0..n} binomial(k*j,n-j)/j!.at n=64A361277