143208

Appears in sequences

• Number of diagonal dissections of a convex n-gon into n-4 regions.at n=7A002055
• Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.at n=52A033282
• Number of atoms in cluster of n layers around C_60.at n=34A063498
• Eighth column (m=7) of (1,6)-Pascal triangle A096956.at n=12A097298
• Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks at level one (n >= 1; 0 <= k <= n-1).at n=47A126216
• Triangle T(n,k), 0 <= k <= n, read by rows, given by [1,1,1,1,1,1,1,...] DELTA [0,1,0,1,0,1,0,1,0,...] where DELTA is the operator defined in A084938.at n=57A133336
• Number T(n,k) of length 2n words such that all letters of the k-ary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting doublets into the initially empty word; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=53A256117
• Number of words of length 2n such that all letters of the octonary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting doublets into the initially empty word.at n=1A258495
• Triangle read by rows: T(n, k) = binomial(2*n, n + k) * binomial(n + 1, k)/(n + 1).at n=47A286784
• Numbers k such that 421*2^k+1 is prime.at n=22A316712
• Triangle read by rows: T(n,k) = binomial(n+1,k+1) * binomial(5*n-4*k+1,k) / (n+1), 0<=k<=n.at n=52A391048