1744436

Appears in sequences

• a(n) = 2^(2*n+1) - binomial(2*n+1, n+1).at n=10A000346
• Chvatal conjecture for radius of graph of maximal intersecting sets.at n=22A007008
• a(n) = Sum_{k=0..10} binomial(n,k).at n=22A008863
• a(n) = 2^n - binomial(n, floor(n/2)).at n=21A045621
• a(n) = 2^(n-1) - ((1+(-1)^n)/4)*binomial(n, n/2).at n=22A058622
• Number of horizontal segments in all dispersed Dyck paths of length n (i.e., in all Motzkin paths of length n with no (1,0)-steps at positive heights; a horizontal segment is a maximal sequence of consecutive (1,0)-steps).at n=22A191391
• Triangle read by rows: T(n,g) is the number of rooted maps with n edges and 2 faces on an orientable surface of genus g.at n=30A270406
• a(n) = 2^(n-1) + ((1+(-1)^n)/4)*binomial(n, n/2) - binomial(n, floor(n/2)).at n=22A294175