20292
domain: N
Appears in sequences
- a(n) = Sum_{k=0..2n-1} T(n,k) * T(n,k+1), with T given by A026536.at n=6A027268
- Consider triangle in which n-th row contains the smallest set of n consecutive numbers whose LCM is divisible by primorial(n) (the product of first n primes). Sequence contains the first column.at n=21A083130
- 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, 1, -1), (-1, 1, 1), (0, 1, 1), (1, -1, 0)}.at n=10A148372
- 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, 1), (-1, 1, -1), (-1, 1, 1), (0, 1, 1), (1, -1, 0)}.at n=10A148373
- a(n) = 100*n^2 - 151*n + 57.at n=14A157626
- Number of binary strings of length n with no substrings equal to 0010 0110 or 1101.at n=17A164499
- Triangle read by rows: T(n,k) is the number of compositions of n having degree of asymmetry equal to k (n>=0; 0<=k<=n/3).at n=59A275433
- Number of nX4 0..1 arrays with every element unequal to 0, 1, 3, 5 or 6 king-move adjacent elements, with upper left element zero.at n=9A304665