27876

Appears in sequences

• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (0, 0, 1), (0, 1, 0), (1, 0, -1)}.at n=9A149887
• Triangle T(n,k) with the coefficient of [x^k] of the series (1-x)^(n+1)* Sum_{j>=0} binomial(n + 4*j, 4*j)*x^j in row n, column k.at n=35A178619
• Number of arrangements of 4 nonzero numbers x(i) in -n..n with the sum of trunc(x(i)/x(i+1)) equal to zero.at n=10A189547
• Number of nondecreasing sequences of n 1..7 integers with every element dividing the sequence sum.at n=34A212535
• Number of (3+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=16A250758
• Triangle read by rows: T(n,m) is the number of quaternary words of length n with m strictly increasing runs (0 <= m <= n).at n=41A265644
• Expansion of Product_{k>=1} ((1 + x^k) * (1 + 3*x^k)).at n=19A266822
• a(n) = 6*n*(9*n-5).at n=23A277984
• Number of nX1 0..3 arrays with rows and columns in lexicographic nondecreasing order but with exactly three mistakes.at n=7A278604
• T(n,k)=Number of nXk 0..3 arrays with rows and columns in lexicographic nondecreasing order but with exactly three mistakes.at n=28A278610
• T(n,k)=Number of nXk 0..3 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly three mistakes.at n=28A278896
• Solution of the complementary equation a(n) = 2*a(n-2) - b(n-1) + n, where a(0) = 4, a(1) = 5, b(0) = 1, and (a(n)) and (b(n)) are increasing complementary sequences.at n=27A295068
• Least number of consecutive primes beginning with 2, the sum of which (A007504) is >= 2^n.at n=32A323360
• a(n) is the sequence of turns in the n-th iteration of the dragon curve encoded in binary (L=1, R=0) represented in decimal.at n=3A337580