68068
domain: N
Appears in sequences
- a(n) = (1/2)*(binomial(2n, n) - binomial(2n-2, n-1)).at n=8A024482
- 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) = 2. Also a(n) = sum of numbers in row n+1 of array T defined in A026009.at n=17A026010
- Even numbers to the right of the central numbers of the (1,2)-Pascal triangle A029635.at n=44A029643
- Even numbers to the left of the central elements of the (2,1)-Pascal triangle A029653.at n=50A029665
- a(n) = f(n,4) where f is given in A034261.at n=13A034264
- (Terms in A029661)/2.at n=46A051430
- Expansion of g.f.: (1+4*x)/(1-x)^7.at n=12A051946
- a(n) = binomial(n+7, 7)*(n+4)/4.at n=10A053347
- Denominator of Sum_{i+j+k=n, i,j,k>=1} (i*j)/k.at n=18A076175
- a(n) = binomial(2n-3,n-1) + binomial(2n-2,n-2).at n=9A097613
- Square array read by antidiagonals: S(p,q) = (p+q+1)!(2p+2q+1)!/((p+1)!(2p+1)!(q+1)!(2q+1)!) (p,q>=0).at n=40A111910
- a(n) = (4*n+1)!/( (2*n+1)! * ((n+1)!)^2 ).at n=4A111911
- Denominator of rational part of raw moment n of the line point picking problem.at n=17A115389
- a(n) = n*(n+1)*(11*n+1)/6.at n=33A132112
- Triangle read by rows: T(n, m) = binomial(n + m - 3, m - 1)*(2 * m + n - 2) / m, for n>=1 and 1<=m<=n.at n=54A177851
- Number of undirected labeled graphs on n+3 nodes with exactly n cycle graphs as connected components.at n=11A215773
- Coefficient array for the powers of x^2 of the square of the even-indexed Chebyshev C polynomials.at n=53A220668
- Triangle T(n,k), 0 <= k <= n, read by rows defined by: T(n,k) = (binomial(2*n,2*k) + binomial(2*n+1,2*k))/2.at n=50A232535
- Number of inequivalent (mod D_3) ways to place 3 points on a triangular grid of side n so that they are not vertices of an equilateral triangle of any orientation.at n=14A243142
- Number of compositions of n in which the minimal multiplicity of parts equals 8.at n=18A244171