565722720

Appears in sequences

• a(n) = binomial coefficient C(2n, n-1).at n=16A001791
• Valence of graph of maximal intersecting families of sets.at n=31A007007
• Binomial coefficient C(32,n).at n=15A010948
• Binomial coefficient C(32,n).at n=17A010948
• a(n) = binomial(n,15).at n=17A010968
• a(n) = binomial(n,17).at n=15A010970
• a(n) = number of (s(0), s(1), ..., s(n)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| = 1 for i = 1,2,...,n and s(0) = 3. Also a(n) = Sum{T(n,k), k = 0,1,...,[ (n+3)/2 ]}, where T is defined in A026022.at n=30A026023
• a(n) = binomial(n, floor((n-1)/2)).at n=32A037952
• a(n) = binomial(n, floor(n/2)-1).at n=32A037955
• T(2n+2,n), array T as in A050186; a count of aperiodic binary words.at n=15A051195
• Expansion of (1+x)c(x^2)/((1-x^2*c(x^2))sqrt(1-4x^2)), c(x) the g.f. of A000108.at n=30A117187
• G.f.: A(x,y) = Sum_{n>=0,m>=0} (2^m-1)^n*x^n * log(1+y)^m/m!.at n=53A163353
• a(n) = (n!*m)/(m!*(m+1)!) where m = floor(n/2).at n=32A237884
• a(n) = A(n) if n is even else a(n) = A(n)*(n-1)/(n+1) with A(n) = ((n-1)!/ floor((n-1)/2)!^2).at n=32A274707
• Triangle T read by rows: n-th row (n>=0) gives the non-vanishing coefficients of the polynomial q(n,x) = ((x+1)^(2^n) - (x-1)^(2^n))/2.at n=23A281122
• Triangle T read by rows: n-th row (n>=0) gives the non-vanishing coefficients of the polynomial q(n,x) = ((x+1)^(2^n) - (x-1)^(2^n))/2.at n=24A281122