37805
domain: N
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), (-1, 1, -1), (1, 0, 1), (1, 1, 0)}.at n=8A150684
- Number of length n+6 0..4 arrays with every seven consecutive terms having the maximum of some two terms equal to the minimum of the remaining five terms.at n=0A250150
- T(n,k)=Number of length n+6 0..k arrays with every seven consecutive terms having the maximum of some two terms equal to the minimum of the remaining five terms.at n=6A250154
- Number of length 1+6 0..n arrays with every seven consecutive terms having the maximum of some two terms equal to the minimum of the remaining five terms.at n=3A250155
- Number of length 4 arrays x(i), i=1..4 with x(i) in i..i+n and no value appearing more than 2 times.at n=12A250353