35750

Appears in sequences

• Number of compositions of n into 5 ordered relatively prime parts.at n=28A000743
• 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=16A026010
• Even numbers to the left of the central elements of the (1,2)-Pascal triangle A029635.at n=38A029647
• Even numbers to the right of the central numbers of the (2,1)-Pascal triangle A029653.at n=31A029661
• Triangle read by rows: T(n,k) = number of 2 X inf arrays [ n, n1, n2, ...; k, k1, k2,... ] with n>=n1>n2>...>=0, k>=k1>k2...>=0, n>k, n1>k1, ...; n >= 1, k >= 0. Note that once ni or ki = 0, the strict inequalities become equalities (constant 0 thereafter).at n=43A039597
• A convolution triangle of numbers generalizing Pascal's triangle A007318.at n=41A049326
• a(n) = binomial(2*n,n) - binomial(2*n-2,n-1); or (3n-2)*C(n-1), where C = Catalan numbers (A000108).at n=8A051924
• 1/256 of tenth unsigned column of triangle A053120 (T-Chebyshev, rising powers, zeros omitted).at n=8A054333
• Triangle of binomial(n,k)*(binomial(n+k,k)-binomial(n+k-2,k-1)).at n=54A080721
• a(n) = binomial(n+2,3)*5^3.at n=10A141480
• Triangle T(n,k) (n >= 0, 0 <= k <= n) read by rows: T(n,0) = T(n,1) = A000984(n); for n >= 2 and k >= 2, T(n,k) = T(n,k-1) - T(n-1,k-2).at n=47A171661
• a(n) = binomial(n + 10, 10) * 5^n.at n=3A173113
• Number of strings of numbers x(i=1..n) in 0..2 with sum i*x(i)^2 equal to n*4.at n=18A184434
• Numbers n such that n = Sum_{j>=1} c(j) where c(0) = n, c(j) = floor(c(j-1)/10^k)*(c(j-1) mod 10^k) for j>0, and k is half the number of digits of n, rounded up if the number of digits of n is odd.at n=7A258584
• Triangle read by rows: T(n,k) (0<=k<=n) given by T(n,0)=1, T(n,n) = binomial(2n,n); otherwise T(n,k) = T(n,k-1)+T(n-1,k).at n=53A274292
• Triangle read by rows: T(n,k) (0 <= k <= n) given by T(n,0) = 1, T(n,1) = 2^n - 1, T(n,2) = 2^n - 2, T(n,n-1) = T(n,n) = binomial(2n-2,n-1); and the other internal entries satisfy T(n,k) = T(n,k-1) + T(n-1,k).at n=63A274293
• Number of orthogonal rectangles with vertices on an n X n square grid of points but with no vertices on the grid's diagonals.at n=22A285956
• a(n) = prime(n) * prime(n^2) - prime(n^3).at n=14A291541
• a(n) is the number of ballot sequences of length n tied or won by at most 2 votes.at n=16A337499
• a(n) is the number of ballot sequences of length n tied or won by at most 3 votes.at n=16A337500