41226

Appears in sequences

• Number of ways of choosing at most n-1 items from a set of size 2*n+1.at n=8A008549
• a(n) = Sum_{k=0..7} binomial(n,k).at n=17A008860
• a(n) = 2^n - C(n,0)- ... - C(n,9).at n=17A035042
• A convolution triangle of numbers, generalizing Pascal's triangle A007318.at n=37A035324
• a(n) = 2^(n-1) - binomial(n, floor(n/2)).at n=16A093387
• a(n) = a(n-1) + Sum_{0<k<=n/5} a(n-5k) with a(0)=1.at n=37A113444
• Smallest squarefree k such that the first n nonzero values of mu(j), j>=k, are all equal (mu is the Moebius function).at n=15A133295
• Number of walks f length n on a square lattice ending with x > 0 and y > 0.at n=9A186648
• Riordan matrix (1/(1-4x),(1-sqrt(1-4x))/2).at n=47A187926
• Partial sums of A253088.at n=40A255048
• a(n) = 2^(n-1) + ((1+(-1)^n)/4)*binomial(n, n/2) - binomial(n, floor(n/2)).at n=17A294175
• Number of planar vertically indecomposable distributive lattices with n nodes.at n=30A345734