42780

Appears in sequences

• a(n) = n*(n + 1)*(n^2 - 3*n + 5)/6.at n=23A006484
• a(1) = 1; for n >= 1, a(n+1) is smallest number such that the sums of any one, two or three of a(1), ..., a(n) are distinct (repetitions not allowed).at n=28A062065
• Triangle read by rows: T(n, k) = binomial(3*n, k-1) + binomial(3*n, n-k).at n=30A156003
• Triangle read by rows: T(n, k) = binomial(3*n, k-1) + binomial(3*n, n-k).at n=33A156003
• a(n) = n*(n+1)*(7*n-6)/2.at n=23A256718
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 491", based on the 5-celled von Neumann neighborhood.at n=37A272541
• Maximal Laman number among all minimally rigid graphs on n vertices.at n=13A306420
• Number of ways to partition the set of vertices of a convex {n+8}-gon into 3 non-intersecting polygons.at n=23A350116
• Primitive terms of A388036.at n=45A388037