26333

Appears in sequences

• a(n) = 2^(2*n+1) - binomial(2*n+1, n+1).at n=7A000346
• Chvatal conjecture for radius of graph of maximal intersecting sets.at n=16A007008
• a(n) = Sum_{k=0..7} binomial(n,k).at n=16A008860
• a(n) = 2^n - C(n,0) - C(n,1) - ... - C(n,8).at n=16A035041
• a(n) = 2^n - binomial(n, floor(n/2)).at n=15A045621
• A triangle related to A000108 (Catalan) and A000302 (powers of 4).at n=37A046527
• Triangle T(n,k) giving number of rooted maps regardless of genus with n edges and k nodes (n >= 0, k = 1..n+1).at n=43A053979
• a(n) = 2^(n-1) - ((1+(-1)^n)/4)*binomial(n, n/2).at n=16A058622
• a(n) = binomial(n+6,5) - 1.at n=16A062988
• a(n) = 2*a(n-1) + (-1)^n*a(floor(n/2)); a(1)=1.at n=14A089067
• Table T(n,k), n>=0 and k>=0, read by antidiagonals : the k-th column given by the k-th polynomial K_k related to A090285.at n=47A090299
• Triangle T(n,k), 0<=k<=n, read by rows; given by [0, 1, 0, 2, 0, 3, 0, 4, 0, 5, 0, ...] DELTA [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...] where DELTA is the operator defined in A084938.at n=53A094456
• Counterexamples to the conjecture that an even, prime-indexed triangular plus 1 equals a prime or that an odd, prime-indexed triangular minus 2 equals a prime.at n=18A097785
• Riordan array (1/sqrt(1-4*x), (1/sqrt(1-4*x)-1)/2).at n=37A116395
• Numerators of partial sums of Catalan numbers scaled by powers of 1/4.at n=7A120778
• Numerators in the expansion of (1-sqrt(1-x^2))/(1-x).at n=16A141244
• Numerators in the expansion of (1-sqrt(1-x^2))/(1-x).at n=17A141244
• Number of binary strings of length n with no substrings equal to 0001 0100 or 1010.at n=15A164465
• Riordan matrix (1/(1-4x),(1-sqrt(1-4x))/2).at n=37A187926
• 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=16A191391