18150

Appears in sequences

• a(n) = 3^n - 3*2^n + 3.at n=9A001117
• Stirling numbers of first kind, s(n+3, n), negated.at n=7A001303
• Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n).at n=38A019538
• dot product (n,n-1,...2,1).(3,4,...,n,1,2).at n=42A026054
• T(n,1) + T(n,2) + ... T(n,n), where T is the array in A026098.at n=29A026101
• Triangle whose (i,j)-th entry is binomial(i,j)*5^(i-j)*11^j.at n=12A038253
• Triangle whose (i,j)-th entry is binomial(i,j)*11^(i-j)*5^j.at n=12A038319
• Number of sublattices of index n in generic 4-dimensional lattice.at n=17A038991
• Number of palindromes of length n using exactly three different symbols.at n=17A056454
• Number of palindromes of length n using exactly three different symbols.at n=16A056454
• Number of primitive (aperiodic) palindromes using exactly three different symbols.at n=16A056464
• Number of periodic palindromes using exactly three different symbols.at n=16A056489
• Number of primitive (period n) periodic palindromes using exactly three different symbols.at n=16A056499
• Number of 4-block ordered tricoverings of an unlabeled n-set.at n=43A060488
• n^2(n+1)(2n+1)^2(7n+1)/36.at n=5A073351
• Numbers n such that A001414(n) = sum of composites from the smallest prime factor of n to the largest prime factor of n.at n=7A074053
• Array T(m,n) read by antidiagonals: T(m,n) = number of ways of 3-coloring an m X n grid (m >= 1, n >= 1).at n=31A078099
• Array T(m,n) read by antidiagonals: T(m,n) = number of ways of 3-coloring an m X n grid (m >= 1, n >= 1).at n=32A078099
• T(n, k) = Sum_{j=0..n-k} (-1)^j*binomial(n - k + 1, j)*(n - k + 1 - j)^n. Triangle read by rows, T(n, k) for 1 <= k <= n.at n=42A090582
• Triangle of numbers T(n,k) = k!*Stirling2(n,k) = A000142(k)*A048993(n,k) read by rows, T(n, k) for 0 <= k <= n.at n=48A131689