347373600
domain: N
Appears in sequences
- Binomial coefficients C(2n,n-3).at n=13A002696
- Binomial coefficient C(32,n).at n=13A010948
- Binomial coefficient C(32,n).at n=19A010948
- a(n) = binomial(n,13).at n=19A010966
- a(n) = binomial(n,19).at n=13A010972
- a(n) = binomial(n, floor((n-6)/2)).at n=32A037957
- T(2n+6,n), array T as in A050186; a count of aperiodic binary words.at n=13A051199
- G.f.: A(x,y) = Sum_{n>=0,m>=0} (2^m-1)^n*x^n * log(1+y)^m/m!.at n=55A163353
- 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=22A281122
- 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=25A281122
- Number of ordered rooted binary trees with n leaves and with minimal Sackin tree balance index.at n=45A345135
- a(n) = least number in row n of Pascal's triangle that exceeds every number in row n-1.at n=30A382851