199140

Appears in sequences

• a(n) = Sum_{k=0..10} binomial(n,k).at n=18A008863
• a(n) = 2^n - C(n,0) - C(n,1) - ... - C(n,7).at n=18A035040
• Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and have k peaks of the form ud.at n=36A108446
• Number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have no peaks of the form ud.at n=8A108447
• Triangle, read by rows, where diagonals are successive self-convolutions of A108447.at n=53A118343
• Number of n X 3 nonnegative integer arrays with upper left 0 and lower right its king-move distance away minus 3 and every value increasing by 0 or 1 with every step right, diagonally se or down.at n=13A253006
• a(n) = Sum_{i=0..n+1} binomial(2*n,n-i+1).at n=9A277924
• a(n) = number of subsets of {1,2,...,n} that contain more nonprimes than primes.at n=18A369853