20350

Appears in sequences

• Number of paraffins.at n=42A005997
• Fibonacci sequence beginning 1, 20.at n=16A022110
• a(n) = floor((3rd elementary symmetric function of 2,3,...,n+3)/(2+3+...+n+3)).at n=23A024178
• a(n) = n*(2*n^2 - 2*n + 1).at n=22A059722
• Total sum of odd parts in all partitions of n.at n=23A066967
• Inverse Moebius transform of 5-simplex numbers A000389.at n=16A101289
• 10 times pentagonal numbers: a(n) = 5*n*(3*n-1).at n=37A153780
• Triangle read by rows: T(n,k) is the number of weighted lattice paths in L_n having k (1,-1)-returns to the horizontal axis. The members of L_n are paths of weight n that start at (0,0), end on the horizontal axis and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps.at n=54A182896
• Principal diagonal of the convolution array A213836.at n=19A213837
• Number of (4+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 1 3 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 1 3 6 or 7.at n=7A252309
• Partial sums of A255743.at n=28A255764
• Number of length-4 0..n arrays with no repeated value differing from the previous repeated value by other than one.at n=10A269538
• a(n) = binomial(n + 4, n - 1) + 1.at n=17A323228
• Coefficients in the power series expansion of A(x) = Sum_{n=-oo..+oo} n*(n+1)*(n+2)*(n+3)/24 * x^(4*n) * (1 - x^n)^(n-2).at n=64A357157